Decomposition of the complete graph plus a 1-factor into cycles of equal length. (English) Zbl 1016.05058

The author determines the necessary and sufficient condition for the existence of a decomposition of the complete graph of even order with a 1-factor added into cycles of equal length.


05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C38 Paths and cycles
Full Text: DOI


[1] Alspach, J Combin Theory Ser B 81 pp 77– (2001)
[2] and Cycle decomposition of Kn + I, to be submitted.
[3] Alspach, Ann Discrete Math 9 pp 155– (1980)
[4] Decomposition of a complete graph into cycles of length less than or equal to 50, M.Sc. Thesis, Auburn University, 1991.
[5] Bermond, J Combin Theory Ser B 46 pp 142– (1989)
[6] De Vries, Discrete Math 52 pp 293– (1984)
[7] Hoffman, J Graph Theory 13 pp 417– (1989)
[8] Kotzig, Mat-Fyz ?as 15 pp 227– (1965)
[9] ?ec?eations Mat??ematiques, vol. II, Gauthiers Villars, Paris, 1892.
[10] Rosa, Mat-Fyz ?as 16 pp 349– (1966)
[11] Cycle decompositions of Kn and Kn ? I, Ph.D. Thesis, Simon Fraser University, 1999.
[12] ?ajna, Discrete Math 244 pp 435– (2002)
[13] ?ajna, J Combin Des 10 pp 27– (2002)
[14] Sotteau, J Combin Theory Ser B 29 pp 75– (1981)
[15] Stern, Boll Un Math Ital A 17 pp 109– (1980)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.