Cyclic even cycle systems of the complete graph

DOI10.1002/jcd.20310zbMath1250.05064OpenAlexW1978508707MaRDI QIDQ3165556

Shung-Liang Wu

Publication date: 29 October 2012

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20310

zbMATH Keywords

complete graphcirculant graphcyclic cycle system

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (4)

Primitive cycle decompositions of Kn and Kn−I ⋮ Cyclic cycle systems of the complete multipartite graph ⋮ On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\) ⋮ Mutually orthogonal cycle systems

Cites Work

• Unnamed Item
• A non-existence result on cyclic cycle-decompositions of the cocktail party graph
• Skolem-type difference sets for cycle systems
• Cyclic Hamiltonian cycle systems of the complete graph.
• Cyclically decomposing the complete graph into cycles
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Existence of cyclic \(k\)-cycle systems of the complete graph
• On the cyclic decomposition of complete graphs into almost-bipartite graphs
• Cycle decompositions III: Complete graphs and fixed length cycles
• Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power
• A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
• Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
• On the cyclic decompositions of the complete graph into polygons with odd number of edges

This page was built for publication: Cyclic even cycle systems of the complete graph