Dihedral Hamiltonian cycle systems of the cocktail party graph

DOI10.1002/JCD.21311MaRDI QIDQ4909339zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• \(\phi\)-symmetric Hamilton cycle decompositions of graphs
• Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs
• A non-existence result on cyclic cycle-decompositions of the cocktail party graph
• Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
• Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph

Cites work

• scientific article; zbMATH DE number 3675916 (Why is no real title available?)
• A non-existence result on cyclic cycle-decompositions of the cocktail party graph
• Cycle decompositions with a sharply vertex transitive automorphism group
• Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
• Cyclic Hamiltonian cycle systems of the complete graph.
• Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
• Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3
• On Hamiltonian paths with prescribed edge lengths in the complete graph
• On a problem of Marco Buratti
• On decomposing \(K_n -I\) into cycles of a fixed odd length
• On the construction of odd cycle systems
• On the existence of elementary Abelian cycle systems
• One-factorizations of complete graphs with vertex-regular automorphism groups
• Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
• Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor

Cited in

(19)

• The seating couples problem in the even case
• Growable realizations: a powerful approach to the Buratti-Horak-Rosa conjecture
• A non-existence result on cyclic cycle-decompositions of the cocktail party graph
• On unitary/strong linear realizations: Buratti-Horak-Rosa conjecture
• A new result on the problem of Buratti, Horak and Rosa
• New methods to attack the Buratti-Horak-Rosa conjecture
• Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs
• The structure of 2-pyramidal 2-factorizations
• On the Buratti-Horak-Rosa conjecture about Hamiltonian paths in complete graphs
• \(\phi\)-symmetric Hamilton cycle decompositions of graphs
• On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching
• A generalization of the problem of Mariusz Meszka
• Constructions of dihedral Steiner quadruple systems
• Hamiltonian cycle systems which are both cyclic and symmetric
• Graphs with sparsity order at most two: the complex case
• On diagonal cycle systems
• Some results on 1-rotational Hamiltonian cycle systems
• On the full automorphism group of a Hamiltonian cycle system of odd order
• On cyclic symmetric Hamilton cycle decompositions of complete multipartite graphs

This page was built for publication: Dihedral Hamiltonian cycle systems of the cocktail party graph

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