Conference paper
Evaluating public service delivery in emerging markets
Arun Sharma, G.R. Gangadharan, et al.
SOLI 2011
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
Australasian Journal of Combinatorics
Alan Hartman
Discrete Mathematics
Alan Hartman
Journal of Combinatorial Theory, Series A