A note on the middle levels problem
From MaRDI portal
Publication:299111
Recommendations
Cites work
- scientific article; zbMATH DE number 3838053 (Why is no real title available?)
- scientific article; zbMATH DE number 3916312 (Why is no real title available?)
- scientific article; zbMATH DE number 3752880 (Why is no real title available?)
- scientific article; zbMATH DE number 2059939 (Why is no real title available?)
- scientific article; zbMATH DE number 1439443 (Why is no real title available?)
- An explicit 1-factorization in the middle of the Boolean lattice
- An inductive construction for Hamilton cycles in Kneser graphs
- An update on the middle levels problem
- Explicit 2-factorizations of the odd graph
- Hamiltonian circuits in random graphs
- Hamiltonian cycles in Kneser graphs for \(n=2k+2\)
- Hamiltonian paths in odd graphs
- Odd Graphs Are Prism-Hamiltonian and Have a Long Cycle
- On hamiltonian cycles in the prism over the odd graphs
- The prism over the middle-levels graph is Hamiltonian
- Triangle-free Hamiltonian Kneser graphs
Cited in
(5)
This page was built for publication: A note on the middle levels problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299111)