Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
From MaRDI portal
Publication:2427503
DOI10.1016/j.disc.2007.05.009zbMath1172.05332OpenAlexW1987220346MaRDI QIDQ2427503
Publication date: 13 May 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.05.009
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (14)
A cyclic solution for an infinite class of Hamilton-Waterloo problems ⋮ Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles ⋮ Hamiltonian Cycle Systems Which Are Both Cyclic and Symmetric ⋮ On the full automorphism group of a Hamiltonian cycle system of odd order ⋮ Cyclic cycle systems of the complete multipartite graph ⋮ Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph ⋮ Cyclic uniform 2-factorizations of the complete multipartite graph ⋮ Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs ⋮ Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph ⋮ Unnamed Item ⋮ Globally simple Heffter arrays and orthogonal cyclic cycle decompositions ⋮ Some Results on 1‐Rotational Hamiltonian Cycle Systems ⋮ Unnamed Item ⋮ \(\phi\)-symmetric Hamilton cycle decompositions of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cyclic one-factorization of the complete 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
- 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 Hamiltonian cycle systems of the complete graph minus a 1-factor