Alan Hartman, Dean G. Hoffman
European Journal of Combinatorics
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
Conference paper
The AGEDIS tools for model based testing
Alan Hartman, Kenneth Nagin
UML Satellite Activities 2004
Alan Hartman
Journal of Combinatorial Theory, Series A
Conference paper
Evaluating public service delivery in emerging markets
Arun Sharma, G.R. Gangadharan, et al.
SOLI 2011