Cycle decompositions of complete multigraphs

DOI10.1002/jcd.20263zbMath1205.05176arXiv1508.00645MaRDI 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\)-design; graph decomposition; cycle decomposition

Mathematics Subject Classification ID

05C38: Paths and cycles

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

Related Items

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

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