A note on the middle levels problem

DOI10.1016/j.dam.2015.08.001zbMath1338.05149OpenAlexW1130631849MaRDI QIDQ299111

Rodrigo A. Hausen, Andréia C. S. Gusmão, Letícia R. Bueno, Celina M. H. Figueiredo, Luérbio Faria

Publication date: 22 June 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.08.001

zbMATH Keywords

Hamiltonian cycleHamiltonian pathKneser graphmiddle levels graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An inductive construction for Hamilton cycles in Kneser graphs
• An update on the middle levels problem
• Hamiltonian circuits in random graphs
• An explicit 1-factorization in the middle of the Boolean lattice
• Triangle-free Hamiltonian Kneser graphs
• Explicit 2-factorizations of the odd graph
• The prism over the middle-levels graph is Hamiltonian
• Hamiltonian Cycles in Kneser Graphs for
• On hamiltonian cycles in the prism over the odd graphs
• Hamiltonian paths in odd graphs
• Odd Graphs Are Prism-Hamiltonian and Have a Long Cycle

This page was built for publication: A note on the middle levels problem