Packing cycles in complete graphs

DOI10.1016/j.jctb.2007.12.004zbMath1162.05037OpenAlexW1966935088MaRDI QIDQ947728

Daniel Horsley, Darryn E. Bryant

Publication date: 7 October 2008

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2007.12.004

zbMATH Keywords

cycle decompositionsgraph decompositionsgraph packing

Mathematics Subject Classification ID

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

Related Items (13)

Small embeddings for partial 5-cycle systems ⋮ Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges ⋮ Maximum packings of the complete graph with uniform length cycles ⋮ Face 2-Colorable Embeddings with Faces of Specified Lengths ⋮ Decomposition of a complete bipartite multigraph into arbitrary cycle sizes ⋮ Almost resolvable maximum packings of complete graphs with 5-cycles ⋮ An asymptotic solution to the cycle decomposition problem for complete graphs ⋮ Decompositions of complete multigraphs into cycles of varying lengths ⋮ Packing paths in complete graphs ⋮ Small cycles and 2-factor passing through any given vertices in graphs ⋮ Cycle decompositions of complete multigraphs ⋮ Cycle packings of the complete multigraph ⋮ Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
• On Alspach's conjecture
• Packing pentagons into complete graphs: How clumsy can you get?
• On Alspach's conjecture with two even cycle lengths
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• On the Alspach Conjecture
• Packing Circuits into K_N
• Cycle decompositions III: Complete graphs and fixed length cycles
• A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
• Embedding Partial Steiner Triple Systems
• Packing and Covering of the Complete Graph with 4-Cycles^*
• Decompositions of complete graphs into triangles and Hamilton cycles

This page was built for publication: Packing cycles in complete graphs