Cycle decompositions of complete multigraphs
From MaRDI portal
Publication:5901025
DOI10.1002/jcd.20229zbMath1216.05117OpenAlexW4240555166MaRDI QIDQ5901025
Publication date: 3 August 2010
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20229
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (10)
Unnamed Item ⋮ Decompositions of complete multigraphs into cycles of varying lengths ⋮ Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd ⋮ Decompositions of some regular graphs into unicyclic graphs of order five ⋮ Cycle decompositions of complete multigraphs ⋮ 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 ⋮ Cycle packings of the complete multigraph ⋮ A \(C_5\)-decomposition of the \(\lambda\)-fold line graph of the complete graph ⋮ Closed trail decompositions of some classes of regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Existence of cyclic \(k\)-cycle systems of the complete graph
- Existence of 1-rotational \(k\)-cycle systems of the complete graph
- The Existence and Construction of Balanced Incomplete Block Designs
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
This page was built for publication: Cycle decompositions of complete multigraphs