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

Improving Productivity in Design and Development of Information Technology (IT) Service Delivery Simulation Models

Anton Beloglazov, Dipyaman Banerjee, et al.

Journal of Service Research

Conference paper

The AGEDIS tools for model based testing

Alan Hartman, Kenneth Nagin

UML Satellite Activities 2004

Paper

The existence of resolvable Steiner quadruple systems

Alan Hartman

Journal of Combinatorial Theory, Series A

Paper

Covering the complete graph with plane cycles

Alan Hartman, Yoav Medan

Discrete Applied Mathematics

View all publications