Dihedral Hamiltonian cycle systems of the cocktail party graph
DOI10.1002/JCD.21311zbMATH Open1260.05118OpenAlexW1583976033MaRDI QIDQ4909339FDOQ4909339
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
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
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)
Cites Work
- Cyclic Hamiltonian cycle systems of the complete graph.
- Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph
- On a problem of Marco Buratti
- Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3
- On Hamiltonian paths with prescribed edge lengths in the complete graph
- One-factorizations of complete graphs with vertex-regular automorphism groups
- Cycle decompositions with a sharply vertex transitive automorphism group
- Title not available (Why is that?)
- On the construction of odd cycle systems
- On decomposing \(K_n -I\) into cycles of a fixed odd length
- On the existence of elementary Abelian cycle systems
- Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
- Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor
Cited In (19)
- A new result on the problem of Buratti, Horak and Rosa
- Graphs with sparsity order at most two: the complex case
- On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching
- 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 the Buratti-Horak-Rosa conjecture about Hamiltonian paths in complete graphs
- Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs
- The seating couples problem in the even case
- Constructions of dihedral Steiner quadruple systems
- Hamiltonian cycle systems which are both cyclic and symmetric
- On unitary/strong linear realizations: Buratti-Horak-Rosa conjecture
- New methods to attack the Buratti-Horak-Rosa conjecture
- \(\phi\)-symmetric Hamilton cycle decompositions of graphs
- On diagonal cycle systems
- On cyclic symmetric Hamilton cycle decompositions of complete multipartite graphs
- A generalization of the problem of Mariusz Meszka
- On the full automorphism group of a Hamiltonian cycle system of odd order
- The structure of 2-pyramidal 2-factorizations
- Some results on 1-rotational Hamiltonian cycle systems
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)
