Decompositions of complete multigraphs into cycles of varying lengths
From MaRDI portal
Publication:684123
DOI10.1016/j.jctb.2017.09.005zbMath1379.05087OpenAlexW2963545170MaRDI QIDQ684123
Daniel Horsley, Benjamin R. Smith, Barbara M. Maenhaut, Darryn E. Bryant
Publication date: 9 February 2018
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.2017.09.005
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items (12)
Decomposition of a complete bipartite multigraph into arbitrary cycle sizes ⋮ Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment ⋮ GENERALISATIONS OF THE DOYEN–WILSON THEOREM ⋮ Decompositions of complete multigraphs into stars of varying sizes ⋮ Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6 ⋮ Cycle decompositions of complete digraphs ⋮ Decompositions of some regular graphs into unicyclic graphs of order five ⋮ Decompositions of some classes of dense graphs into cycles of lengths 4 and 8 ⋮ On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\) ⋮ Cycle packings of the complete multigraph ⋮ Unnamed Item ⋮ Anchored Hyperspaces and Multigraphs.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
- Packing cycles in complete graphs
- Packing paths in complete graphs
- Decomposition of complete multigraphs into stars
- Another class of balanced graph designs: Balanced circuit designs
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- An asymptotic solution to the cycle decomposition problem for complete graphs
- Cycle decompositions III: Complete graphs and fixed length cycles
- Face 2-Colorable Embeddings with Faces of Specified Lengths
- The Existence and Construction of Balanced Incomplete Block Designs
- On the construction of odd cycle systems
- Decompositions of complete graphs into long cycles
- Hamilton cycle rich two-factorizations of complete graphs
- Decompositions of complete graphs into triangles and Hamilton cycles
- Cycle decompositions V: Complete graphs into cycles of arbitrary lengths
- Cycle decompositions of complete multigraphs
- Cycle decompositions of complete multigraphs
This page was built for publication: Decompositions of complete multigraphs into cycles of varying lengths
