Haim Hanani, Alan Hartman, et al.
Discrete Mathematics
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, Leonid Raskin
Discrete Mathematics
Conference paper
Domain specific approaches to software test automation
Alan Hartman, Mika Katara, et al.
ESEC/FSE 2007
Conference paper
A UML simulator based on a generic model execution engine
Andrei Kirshin, Dany Moshkovich, et al.
ECMS 2006