Cyclic One-Factorization of the Complete Graph

Alan Hartman, Alexander Rosa

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)45-48
Number of pages4
JournalEuropean Journal of Combinatorics
Issue number1
StatePublished - 1985
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Cyclic One-Factorization of the Complete Graph'. Together they form a unique fingerprint.

Cite this