Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph

DOI10.1002/jcd.21311zbMath1260.05118OpenAlexW1583976033MaRDI QIDQ4909339

Marco Buratti, Francesca Merola

Publication date: 13 March 2013

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

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

zbMATH Keywords

Cayley graphdihedral groupcocktail party graphHamiltonian cycle decomposition

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

Growable realizations: a powerful approach to the Buratti-Horak-Rosa Conjecture ⋮ Hamiltonian Cycle Systems Which Are Both Cyclic and Symmetric ⋮ A new result on the problem of Buratti, Horak and Rosa ⋮ On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k\)-matching] ⋮ On the Buratti-Horak-Rosa conjecture about Hamiltonian paths in complete graphs ⋮ On the full automorphism group of a Hamiltonian cycle system of odd order ⋮ On unitary/strong linear realizations: Buratti-Horak-Rosa conjecture ⋮ Graphs with sparsity order at most two: the complex case ⋮ Constructions of dihedral Steiner quadruple systems ⋮ New methods to attack the Buratti-Horak-Rosa conjecture ⋮ A generalization of the problem of Mariusz Meszka ⋮ Some Results on 1‐Rotational Hamiltonian Cycle Systems ⋮ \(\phi\)-symmetric Hamilton cycle decompositions of graphs ⋮ The structure of 2-pyramidal 2-factorizations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a problem of Marco Buratti
• On the existence of elementary Abelian cycle systems
• A non-existence result on cyclic cycle-decompositions of the cocktail party graph
• On decomposing \(K_n -I\) into cycles of a fixed odd length
• Cyclic Hamiltonian cycle systems of the complete graph.
• Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3
• Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
• One-factorizations of complete graphs with vertex-regular automorphism groups
• Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor
• On the construction of odd cycle systems
• 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

This page was built for publication: Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph