Alspach, Brian; Gavlas, Heather Cycle decompositions of \(K_n\) and \(K_n-I\). (English) Zbl 1023.05112 J. Comb. Theory, Ser. B 81, No. 1, 77-99 (2001); corrigendum ibid. 146, 532-533 (2021). Summary: We establish necessary and sufficient conditions for decomposing the complete graph of even order minus a \(1\)-factor into even cycles and the complete graph of odd order into odd cycles. Cited in 2 ReviewsCited in 125 Documents MSC: 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 05C38 Paths and cycles 05B30 Other designs, configurations Keywords:complete graph PDF BibTeX XML Cite \textit{B. Alspach} and \textit{H. Gavlas}, J. Comb. Theory, Ser. B 81, No. 1, 77--99 (2001; Zbl 1023.05112) Full Text: DOI OpenURL References: [1] Alspach, B.; Marshall, S., Even cycle decompositions of complete graphs minus a 1-factor, J. combin. des., 6, 441-458, (1994) · Zbl 0846.05064 [2] Bell, E., Decomposition of K_{n} into cycles of length at most fifty, Ars combin., 40, 49-58, (1995) · Zbl 0845.05073 [3] Bermond, J.-C.; Favaron, O.; Maheo, M., Hamiltonian decomposition of Cayley graphs of degree 4, J. combin. theory ser. B, 46, 142-153, (1989) · Zbl 0618.05032 [4] Bermond, J.-C.; Huang, C.; Sotteau, D., Balanced cycle and circuit designs: even cases, Ars combin., 5, 293-318, (1978) · Zbl 0434.05020 [5] Bermond, J.-C.; Sotteau, D., Balanced cycle and circuit designs: odd cases, Proc. colloq. oberhof ilmenau, 11-32, (1978) · Zbl 0434.05020 [6] Häggkvist, R., A lemma on cycle decompositions, Ann. discrete math., 27, 227-232, (1985) [7] Hoffman, D.G.; Linder, C.C.; Rodger, C.A., On the construction of odd cycle systems, J. graph theory, 13, 417-426, (1989) · Zbl 0704.05031 [8] Linder, C.C.; Rodger, C.A., Decomposition into cycles. II. cycle systems, (), 325-369 · Zbl 0774.05078 [9] Lucas, E., Récréations mathématiques, (1892), Gauthier-Villars Paris [10] Šajna, M., Cycle decompositions of K_{n} and kn−I, (July 1999), Simon Fraser University [11] Sotteau, D., Decompositions of Km, n(K*m, n) into cycles (circuits) of length 2k, J. combin. theory ser. B, 29, 75-81, (1981) · Zbl 0463.05048 [12] Tarsi, M., Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs, J. combin. theory ser. A, 34, 60-70, (1983) · Zbl 0511.05024 [13] Wilson, R.M., Construction and uses of pairwise balanced designs, Math. centre tracts, 55, 18-41, (1974) · Zbl 0312.05010 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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.