Cyclic Hamiltonian cycle systems of the complete graph.
From MaRDI portal
Publication:1428516
DOI10.1016/S0012-365X(03)00267-XzbMath1034.05030OpenAlexW2038942113MaRDI QIDQ1428516
Alberto Del Fra, Marco Buratti
Publication date: 29 March 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00267-x
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items
On the Oberwolfach problem for single-flip 2-factors via graceful labelings, Cyclic even cycle systems of the complete graph, A cyclic solution for an infinite class of Hamilton-Waterloo problems, Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles, A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\), Hamiltonian Cycle Systems Which Are Both Cyclic and Symmetric, Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\), A complete solution to the two-table Oberwolfach problems, Unnamed Item, On the full automorphism group of a Hamiltonian cycle system of odd order, Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor, Cyclic cycle systems of the complete multipartite graph, On cyclic Hamiltonian decompositions of complete \(k\)-uniform hypergraphs, On cyclic decompositions of the complete graph into the 2-regular graphs, 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem, Maximum cyclic 4-cycle packings of the complete multipartite graph, Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph, Cyclic uniform 2-factorizations of the complete multipartite graph, A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv, Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs, Strong difference families over arbitrary graphs, Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph, On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\), On the cyclic decomposition of complete multigraph into near Hamiltonian cycles, Some Results on 1‐Rotational Hamiltonian Cycle Systems, On the existence of elementary Abelian cycle systems, A non-existence result on cyclic cycle-decompositions of the cocktail party graph, On sharply vertex transitive 2-factorizations of the complete graph, Some constructions for cyclic perfect cycle systems, The structure of 2-pyramidal 2-factorizations, Mutually orthogonal cycle systems, Chinese remainder encoding for Hamiltonian cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Skolem-type difference sets for cycle systems
- 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
- Existence of 1-rotational \(k\)-cycle systems of the complete graph
- Cycle decompositions III: Complete graphs and fixed length cycles
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- 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
