Cyclically decomposing the complete graph into cycles

DOI10.1016/J.DISC.2003.12.009zbMATH Open1042.05082OpenAlexW2021488421MaRDI QIDQ1827757FDOQ1827757

Authors: Shung-Liang Wu, Hung-Lin Fu 

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

Recommendations

• Cycle decompositions. V: Complete graphs into cycles of arbitrary lengths
• Cyclically decomposing the complete graph into 2-regular graphs
• scientific article; zbMATH DE number 5844206
• scientific article; zbMATH DE number 4066956
• An asymptotic solution to the cycle decomposition problem for complete graphs

zbMATH Keywords

Skolem sequenceComplete graphCycle systemHooked Skolem sequenceNear Skolem sequence

Mathematics Subject Classification ID

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

Cites Work

• On certain distributions of integers in pairs with given differences
• Verification of a Conjecture of Th. Skolem.
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Title not available (Why is that?)
• Existence of cyclic \(k\)-cycle systems of the complete graph
• The existence of near-Skolem and hooked near-Skolem sequences
• Title not available (Why is that?)
• On the cyclic decompositions of the complete graph into polygons with odd number of edges

Cited In (29)

• On the existence of 5-Sun systems
• On the existence of \(k\)-sun systems
• Decompositions of complete graphs into blown-up cycles \(C_m\)[2]
• Mutually orthogonal cycle systems
• A non-existence result on cyclic cycle-decompositions of the cocktail party graph
• Extended near Skolem sequences Part I
• Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph
• A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\)
• Title not available (Why is that?)
• A note on conservative galaxies, Skolem systems, cyclic cycle decompositions, and Heffter arrays
• On the cyclic decomposition of complete graphs into almost-bipartite graphs
• Cyclic decompositions of complete graphs into \(K_{k,m}+e\): the missing case
• Title not available (Why is that?)
• Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\)
• Cyclic Hamiltonian cycle systems of the complete graph.
• The existence of \((1,m)\)-near-Skolem sequences
• A note on \(\alpha \)-labelings of \(2k\)-sun graphs
• Maximum cyclic 4-cycle packings of the complete multipartite graph
• Title not available (Why is that?)
• Signed Langford sequences and directed cyclic cycle systems
• A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
• Cyclically decomposing the complete graph into 2-regular graphs
• Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
• Destroying cycles in digraphs
• Some constructions for cyclic perfect cycle systems
• On cyclic decompositions of the complete graph into the 2-regular graphs
• Title not available (Why is that?)
• Cyclic even cycle systems of the complete graph
• Some constructions of cyclic clique decompositions of power of cycles

This page was built for publication: Cyclically decomposing the complete graph into cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827757)