Skip to main content
Research
European Journal of Combinatorics
Paper

Cyclic One-Factorization of the Complete Graph

View publication

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. © 1985, Academic Press Inc. (London) Limited. All rights reserved.

Related

View all publications