Cyclically decomposing the complete graph into cycles
From MaRDI portal
Publication:1827757
DOI10.1016/j.disc.2003.12.009zbMath1042.05082OpenAlexW2021488421MaRDI QIDQ1827757
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.12.009
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (20)
On the cyclic decomposition of complete graphs into almost-bipartite graphs ⋮ Cyclic even cycle systems of the complete graph ⋮ A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\) ⋮ Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\) ⋮ On the existence of 5-Sun systems ⋮ Unnamed Item ⋮ Extended near Skolem sequences Part I ⋮ Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor ⋮ On the existence of \(k\)-sun systems ⋮ Unnamed Item ⋮ Cyclic Hamiltonian cycle systems of the complete graph. ⋮ On cyclic decompositions of the complete graph into the 2-regular graphs ⋮ Maximum cyclic 4-cycle packings of the complete multipartite graph ⋮ A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv ⋮ A note on conservative galaxies, Skolem systems, cyclic cycle decompositions, and Heffter arrays ⋮ Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph ⋮ A NOTE ON α-LABELINGS OF 2k-SUN GRAPHS ⋮ A non-existence result on cyclic cycle-decompositions of the cocktail party graph ⋮ Some constructions for cyclic perfect cycle systems ⋮ Mutually orthogonal cycle systems
Cites Work
- Unnamed Item
- Unnamed Item
- The existence of near-Skolem and hooked near-Skolem sequences
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Existence of cyclic \(k\)-cycle systems of the complete graph
- Cycle decompositions III: Complete graphs and fixed length cycles
- On certain distributions of integers in pairs with given differences
- Verification of a Conjecture of Th. Skolem.
- On the cyclic decompositions of the complete graph into polygons with odd number of edges
This page was built for publication: Cyclically decomposing the complete graph into cycles