Cycle decompositions of complete multigraphs
From MaRDI portal
Abstract: We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.
Recommendations
- Decompositions of complete multigraphs into cycles of varying lengths
- Cycle decompositions of complete multigraphs
- Decompositions of complete multipartite graphs into cycles of even length
- Cycle decompositions. V: Complete graphs into cycles of arbitrary lengths
- Cycle packings of the complete multigraph
Cites work
- An asymptotic solution to the cycle decomposition problem for complete graphs
- Another class of balanced graph designs: Balanced circuit designs
- Cycle decompositions of complete multigraphs
- Cycle decompositions of the complete graph.
- Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
- Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
- Decompositions of complete graphs into long cycles
- Decompositions of complete graphs into triangles and Hamilton cycles
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- scientific article; zbMATH DE number 3922695 (Why is no real title available?)
- scientific article; zbMATH DE number 3675916 (Why is no real title available?)
- scientific article; zbMATH DE number 3428942 (Why is no real title available?)
- On Alspach's conjecture
- On Alspach's conjecture with two even cycle lengths
- On decomposing K_n -I into cycles of a fixed odd length
- On the Alspach conjecture
- Packing circuits into K_N.
- Packing cycles in complete graphs
- Packing Digraphs with Directed Closed Trails
- The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.
- The Existence and Construction of Balanced Incomplete Block Designs
Cited in
(52)- Cycle decompositions of crowns
- A new class for large sets of almost Hamilton cycle decompositions
- Cycle multiplicity of some total graphs
- Decompositions of complete multipartite graphs into cycles of even length
- 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\)
- Total-colorings of complete multipartite graphs using amalgamations
- Decomposing complete equipartite multigraphs into cycles of variable lengths: the amalgamation-detachment approach
- On Complete (s,t)-Cycle Systems of Complete Graphs
- Edge-disjoint Decompositions of Complete Multipartite Graphs into Gregarious Long Cycles
- Decompositions of multigraphs into parts with the same size
- Decomposing complete equipartite graphs into short even cycles
- Maximum packings of the complete graph with uniform length cycles
- scientific article; zbMATH DE number 3884216 (Why is no real title available?)
- scientific article; zbMATH DE number 3884217 (Why is no real title available?)
- On cyclic near-Hamiltonian cycle system of the complete multigraph
- On the cyclic decomposition of complete multigraph into near Hamiltonian cycles
- scientific article; zbMATH DE number 5177321 (Why is no real title available?)
- Decompositions of complete graphs into long cycles
- scientific article; zbMATH DE number 3922695 (Why is no real title available?)
- scientific article; zbMATH DE number 3943845 (Why is no real title available?)
- scientific article; zbMATH DE number 4127262 (Why is no real title available?)
- Cycle map for strictly decomposable cycles
- Decomposition of complete uniform multi‐hypergraphs into Berge paths and cycles
- Cycle packings of the complete multigraph
- Uniform decompositions of complete multigraphs into cycles
- Enclosings of decompositions of complete multigraphs in 2-factorizations
- scientific article; zbMATH DE number 874521 (Why is no real title available?)
- A near cyclic \((m_1, m_2, \ldots, m_r)\)-cycle system of complete multigraph
- Cycle decompositions. V: Complete graphs into cycles of arbitrary lengths
- \(K_n( \lambda )\) is fully \(\{P_5,C_6\}\)-decomposable
- scientific article; zbMATH DE number 5879550 (Why is no real title available?)
- On the decompositions of complete graphs into cycles and stars on the same number of edges
- Symmetric Hamilton cycle decompositions of complete multigraphs
- scientific article; zbMATH DE number 2235057 (Why is no real title available?)
- Large sets of wrapped K-K Hamilton cycle decompositions of complete bipartite 3-uniform hypergraphs
- Cycle decompositions of complete multigraphs
- Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment
- Cyclic cycle systems of the complete multipartite graph
- On total chromatic number of complete multipartite graphs
- Total colorings of complete multipartite graphs using amalgamations
- Combinatorial properties of the G-degree
- Decompositions of complete multigraphs into cycles of varying lengths
- Almost resolvable even cycle decompositions of ( K_u K_g)()
- On total chromatic number of complete multipartite graphs
- Four cycle decomposition of K(n, 2)
- On tight 6-cycle decompositions of complete 3-uniform multi-hypergraphs
- Closed trail decompositions of some classes of regular graphs
- Decomposition of complete multigraphs into stars and cycles
- Cyclic Hamiltonian cycle systems of the -fold complete and cocktail party graphs
This page was built for publication: Cycle decompositions of complete multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5894089)
