Alan Hartman
Journal of Combinatorial Theory, Series A
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
Ahmed M. Assaf, Alan Hartman, et al.
Discrete Mathematics
Alan Hartman
Discrete Mathematics
Conference paper
Domain specific approaches to software test automation
Alan Hartman, Mika Katara, et al.
ESEC/FSE 2007