Cyclic One-Factorization of the Complete Graph

Alan Hartman; Alexander Rosa

doi:10.1016/S0195-6698(85)80020-2

Cyclic One-Factorization of the Complete Graph

Alan Hartman
, Alexander Rosa

Research output: Contribution to journal › Article › peer-review

Abstract

It is shown that the complete graph K_n has a cyclic 1-factorization if and only if n is even and n≠2^t, t⩾3.

Original language	English
Pages (from-to)	45-48
Number of pages	4
Journal	European Journal of Combinatorics
Volume	6
Issue number	1
DOIs	https://doi.org/10.1016/S0195-6698(85)80020-2
State	Published - 1985
Externally published	Yes

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Access to Document

10.1016/S0195-6698(85)80020-2

Cite this

@article{b4620cb48e7b419880c4dd7a28fd1fef,

title = "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.",

author = "Alan Hartman and Alexander Rosa",

year = "1985",

doi = "10.1016/S0195-6698(85)80020-2",

language = "English",

volume = "6",

pages = "45--48",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press",

number = "1",

}

TY - JOUR

T1 - Cyclic One-Factorization of the Complete Graph

AU - Hartman, Alan

AU - Rosa, Alexander

PY - 1985

Y1 - 1985

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0002605784

U2 - 10.1016/S0195-6698(85)80020-2

DO - 10.1016/S0195-6698(85)80020-2

M3 - Article

AN - SCOPUS:0002605784

SN - 0195-6698

VL - 6

SP - 45

EP - 48

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

IS - 1

ER -

Cyclic One-Factorization of the Complete Graph

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this