Large sets of Hamilton cycle and path decompositions
From MaRDI portal
Publication:947816
DOI10.1016/j.disc.2007.09.015zbMath1159.05316OpenAlexW2003021683MaRDI QIDQ947816
Publication date: 7 October 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.09.015
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (7)
A new class for large sets of almost Hamilton cycle decompositions ⋮ Large sets of Hamilton cycle and path decompositions of complete bipartite graphs ⋮ Large sets of almost Hamilton cycle and path decompositions of complete bipartite graphs ⋮ On large sets of almost Hamilton cycle decompositions ⋮ Combinatorial properties of the G-degree ⋮ Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs ⋮ Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Cycle decompositions III: Complete graphs and fixed length cycles
- Row-complete latin squares of every composite order exist
- The spectrum for large sets of disjoint mendelsohn triple systems with any index
This page was built for publication: Large sets of Hamilton cycle and path decompositions