Hamilton decompositions of graphs with primitive complements
From MaRDI portal
Publication:1044964
DOI10.1016/j.disc.2008.07.026zbMath1182.05079MaRDI QIDQ1044964
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.07.026
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C45: Eulerian and Hamiltonian graphs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Hamilton decomposable graphs with specified leaves
- Hamiltonian decompositions of complete graphs
- Maximal sets of Hamilton cycles in \(K_{2p}-F\)
- Canonical edge-colourings of locally finite graphs
- Maximal sets of 2-factors and Hamiltonian cycles
- On the Hamilton-Waterloo problem
- Hamilton decompositions of complete graphs with a 3-factor leave.
- The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
- Hamilton cycle rich two-factorizations of complete graphs