Cycle decompositions of complete multigraphs

DOI10.1002/jcd.20263zbMath1205.05176arXiv1508.00645OpenAlexW2162833533MaRDI QIDQ5894089

Barbara M. Maenhaut, Benjamin R. Smith, Darryn E. Bryant, Daniel Horsley

Publication date: 4 February 2011

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.00645

zbMATH Keywords

\(G\)-designgraph decompositioncycle decomposition

Mathematics Subject Classification ID

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

Related Items (21)

Total-colorings of complete multipartite graphs using amalgamations ⋮ Maximum packings of the complete graph with uniform length cycles ⋮ Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths ⋮ Decomposition of a complete bipartite multigraph into arbitrary cycle sizes ⋮ Decomposition of complete multigraphs into stars and cycles ⋮ A new class for large sets of almost Hamilton cycle decompositions ⋮ Combinatorial properties of the G-degree ⋮ On the decompositions of complete graphs into cycles and stars on the same number of edges ⋮ Decompositions of complete multigraphs into cycles of varying lengths ⋮ Large Sets of Wrapped K–K Hamilton Cycle Decompositions of Complete Bipartite 3‐Uniform Hypergraphs ⋮ Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs ⋮ Unnamed Item ⋮ 5-cycle systems of \((\lambda + m) K_{v + 1} - \lambda K_v\) and \(\lambda K_{v + u} - \lambda K_v\) ⋮ Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach ⋮ On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\) ⋮ On cyclic near-Hamiltonian cycle system of the complete multigraph ⋮ On the cyclic decomposition of complete multigraph into near Hamiltonian cycles ⋮ Decomposing complete equipartite graphs into short even cycles ⋮ Cycle packings of the complete multigraph ⋮ On Complete (s,t)-Cycle Systems of Complete Graphs ⋮ Closed trail decompositions of some classes of regular graphs

Cites Work

• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
• On Alspach's conjecture
• Packing cycles in complete graphs
• Another class of balanced graph designs: Balanced circuit designs
• On decomposing \(K_n -I\) into cycles of a fixed odd length
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.
• On Alspach's conjecture with two even cycle lengths
• An asymptotic solution to the cycle decomposition problem for complete graphs
• On the Alspach Conjecture
• Packing Circuits into K_N
• The Existence and Construction of Balanced Incomplete Block Designs
• Decompositions of complete graphs into long cycles
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Decompositions of complete graphs into triangles and Hamilton cycles
• Packing Digraphs with Directed Closed Trails
• Cycle decompositions of complete multigraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycle decompositions of complete multigraphs