Cyclic Hamiltonian cycle systems of the -fold complete and cocktail party graphs
From MaRDI portal
Publication:976170
Recommendations
- Cyclic Hamiltonian cycle systems of the complete graph.
- Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
- Cyclic and symmetric Hamiltonian cycle systems of the complete multipartite graph: even number of parts
- On cyclic near-Hamiltonian cycle system of the complete multigraph
- Dihedral Hamiltonian cycle systems of the cocktail party graph
Cites work
- scientific article; zbMATH DE number 1472137 (Why is no real title available?)
- scientific article; zbMATH DE number 3238443 (Why is no real title available?)
- scientific article; zbMATH DE number 3258859 (Why is no real title available?)
- scientific article; zbMATH DE number 3031875 (Why is no real title available?)
- A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph
- Balanced star decompositions of regular multigraphs and \(\lambda\)-fold complete bipartite graphs
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Cycle decompositions of complete graphs
- Cycle decompositions of complete multigraphs
- Cycle decompositions with a sharply vertex transitive automorphism group
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
- Cyclic Hamiltonian cycle systems of the complete graph.
- Cyclic block designs with block size 3
- Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
- Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power
- Doubly transitive 2-factorizations
- Existence of cyclic \(k\)-cycle systems of the complete graph
- Homogeneous designs and geometric lattices
- Large sets of Hamilton cycle and path decompositions
- On classifying finite edge colored graphs with two transitive automorphism groups.
- On the cyclic decompositions of the complete graph into polygons with odd number of edges
- On the existence of elementary Abelian cycle systems
- 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
- Some constructions for cyclic perfect cycle systems
Cited in
(11)- A new result on the problem of Buratti, Horak and Rosa
- On the Buratti-Horak-Rosa conjecture about Hamiltonian paths in complete graphs
- Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
- On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\)
- Dihedral Hamiltonian cycle systems of the cocktail party graph
- Hamiltonian cycle systems which are both cyclic and symmetric
- Cyclic and symmetric Hamiltonian cycle systems of the complete multipartite graph: even number of parts
- Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph
- On cyclic symmetric Hamilton cycle decompositions of complete multipartite graphs
- Cyclic Hamiltonian cycle systems of the complete graph.
- On cyclic near-Hamiltonian cycle system of the complete multigraph
This page was built for publication: Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976170)