Decomposing the complete graph into cycles of many lengths

DOI10.1007/BF01929478zbMath0829.05043OpenAlexW2055563159MaRDI QIDQ1895814

Darryn E. Bryant, Peter J. Adams

Publication date: 10 January 1996

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01929478

zbMATH Keywords

decompositioncomplete graphcycle lengths

Mathematics Subject Classification ID

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

Related Items (3)

Decomposition of complete bipartite graphs into cycles of distinct even lengths ⋮ Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles ⋮ Decomposition of \(K_{m,n}\) into short cycles

Cites Work

• Unnamed Item
• On Alspach's conjecture

This page was built for publication: Decomposing the complete graph into cycles of many lengths