Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs
From MaRDI portal
Publication:976170
DOI10.1016/j.ejc.2010.01.004zbMath1222.05141OpenAlexW2006670636MaRDI QIDQ976170
Alberto Del Fra, Stefano Capparelli, Marco Buratti
Publication date: 17 June 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2010.01.004
Related Items (5)
Hamiltonian Cycle Systems Which Are Both Cyclic and Symmetric ⋮ A new result on the problem of Buratti, Horak and Rosa ⋮ On the Buratti-Horak-Rosa conjecture about Hamiltonian paths in complete graphs ⋮ On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\) ⋮ On cyclic near-Hamiltonian cycle system of the complete multigraph
Cites Work
- Homogeneous designs and geometric lattices
- Large sets of Hamilton cycle and path decompositions
- On the existence of elementary Abelian cycle systems
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph
- Cyclic block designs with block size 3
- On classifying finite edge colored graphs with two transitive automorphism groups.
- Cyclic Hamiltonian cycle systems of the complete graph.
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Existence of cyclic \(k\)-cycle systems of the complete graph
- Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
- Some constructions for cyclic perfect cycle systems
- Balanced star decompositions of regular multigraphs and \(\lambda\)-fold complete bipartite graphs
- Cycle decompositions III: Complete graphs and fixed length cycles
- Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power
- Doubly transitive 2-factorizations
- A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
- One-Factorizations of Complete Graphs with a Doubly Transitive Automorphism Group
- 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
- Cycle decompositions of complete multigraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs
