European Journal of Combinatorics

Paper

01 Jan 1985

Cyclic One-Factorization of the Complete Graph

View publication

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

Paper

Partial triple systems and edge colourings

Alan Hartman

Discrete Mathematics

Paper

The existence of resolvable Steiner quadruple systems

Alan Hartman

Journal of Combinatorial Theory, Series A

Paper

Problems and algorithms for covering arrays

Alan Hartman, Leonid Raskin

Discrete Mathematics

Conference paper

A UML simulator based on a generic model execution engine

Andrei Kirshin, Dany Moshkovich, et al.

ECMS 2006

View all publications