On hamiltonian cycles in the prism over the odd graphs
From MaRDI portal
Publication:3096955
DOI10.1002/jgt.20550zbMath1229.05192MaRDI QIDQ3096955
Publication date: 15 November 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20550
Related Items
A note on the middle levels problem, On the Hamiltonian property hierarchy of 3-connected planar graphs, Hamiltonian Cycles in Kneser Graphs for
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Long cycles in the middle two layers of the discrete cube
- An update on the middle levels problem
- Explicit matchings in the middle levels of the Boolean lattice
- An explicit 1-factorization in the middle of the Boolean lattice
- Triangle-free Hamiltonian Kneser graphs
- Explicit 2-factorizations of the odd graph
- Hamiltonian decompositions of prisms over cubic graphs
- The prism over the middle-levels graph is Hamiltonian
- Hamiltonian paths in odd graphs
- A characterization of Hamiltonian prisms
- Hamilton cycles in prisms