Anton Beloglazov, Dipyaman Banerjee, et al.
Journal of Service Research
Paper
Cyclic One-Factorization of the Complete Graph
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
Alan Hartman, Andrei Kirshin, et al.
SEAPP 2002
Alan Hartman
Discrete Mathematics
Haim Hanani, Alan Hartman, et al.
Discrete Mathematics