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

Steiner Triple Systems with an Involution

Alan Hartman, Dean G. Hoffman

European Journal of Combinatorics

Conference paper

Evaluating public service delivery in emerging markets

Arun Sharma, G.R. Gangadharan, et al.

SOLI 2011

Paper

Algorithmic aspects of integral designs

Alan Hartman

Australasian Journal of Combinatorics

Paper

Partial triple systems and edge colourings

Alan Hartman

Discrete Mathematics

View all publications