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

Conference paper

Domain specific approaches to software test automation

Alan Hartman, Mika Katara, et al.

ESEC/FSE 2007

Paper

Covering the complete graph with plane cycles

Alan Hartman, Yoav Medan

Discrete Applied Mathematics

Paper

Problems and algorithms for covering arrays

Alan Hartman, Leonid Raskin

Discrete Mathematics

View all publications