Decompositions of complete graphs into long cycles
From MaRDI portal
Publication:3646380
DOI10.1112/blms/bdp069zbMath1207.05153OpenAlexW2132123693MaRDI QIDQ3646380
Darryn E. Bryant, Daniel Horsley
Publication date: 20 November 2009
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/blms/bdp069
Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Small embeddings for partial 5-cycle systems ⋮ Maximum packings of the complete graph with uniform length cycles ⋮ Face 2-Colorable Embeddings with Faces of Specified Lengths ⋮ Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths ⋮ Decomposition of a complete bipartite multigraph into arbitrary cycle sizes ⋮ Decomposing various graphs into short even-length 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 ⋮ Cycle decompositions of complete multigraphs ⋮ Decomposing complete equipartite graphs into short even cycles ⋮ Cycle packings of the complete multigraph
