Scholarly Works

Cyclic One-Factorization of the Complete Graph

Journal article

Cyclic One-Factorization of the Complete Graph

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.

Authors

Hartman A; Rosa A

Journal

European Journal of Combinatorics, Vol. 6, No. 1, pp. 45–48

Publisher

Elsevier

Publication Date

January 1, 1985

DOI

10.1016/s0195-6698(85)80020-2

ISSN

0195-6698

Associated Experts

Alexander Rosa

Professor Emeritus, Faculty of Science

Labels

Fields of Research (FoR)

4901 Applied Mathematics 4904 Pure mathematics 49 Mathematical Sciences

View published work (Non-McMaster Users)

View published work (McMaster Users)

Contact the Experts team

Get technical help

or

Provide website feedback