Conference paper
The AGEDIS tools for model based testing
Alan Hartman, Kenneth Nagin
UML Satellite Activities 2004
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.
Alan Hartman, Kenneth Nagin
UML Satellite Activities 2004
Andrei Kirshin, Dany Moshkovich, et al.
ECMS 2006
G.R. Gangadharan, Anshu N. Jain, et al.
SOLI 2011
Ahmed M. Assaf, Alan Hartman
Discrete Mathematics