Abstract
It is shown that the complete graph Kn has a cyclic 1-factorization if and only if n is even and n≠2t, t⩾3.
Original language | English |
---|---|
Pages (from-to) | 45-48 |
Number of pages | 4 |
Journal | European Journal of Combinatorics |
Volume | 6 |
Issue number | 1 |
DOIs | |
State | Published - 1985 |
Externally published | Yes |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics