Elsevier

Discrete Mathematics

Volume 2, Issue 4, July 1972, Pages 383-387
Discrete Mathematics

Decompositions of complete graphs into regular bichromatic factors

https://doi.org/10.1016/0012-365X(72)90015-5Get rights and content
Under an Elsevier user license
open archive

Abstract

The purpose of this paper is to find a necessary and sufficient condition for the existence of a decomposition of a complete graph with given number of vertices into regular bichromatic factors and to answer the question what is the possible number of factors in such a decomposition.

Cited by (0)