A note on the middle levels problem

DOI10.1016/J.DAM.2015.08.001zbMATH Open1338.05149OpenAlexW1130631849MaRDI QIDQ299111FDOQ299111

Authors: Andréia C. S. Gusmão, L. R. Bueno, R. A. Hausen, C. M. H. Figueiredo, Luerbio 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

Recommendations

• An update on the middle levels problem
• scientific article; zbMATH DE number 1439443
• The prism over the middle-levels graph is Hamiltonian
• On generalized middle-level problem
• Proof of the middle levels conjecture

zbMATH Keywords

Hamiltonian cycleHamiltonian pathKneser graphmiddle levels graph

Mathematics Subject Classification ID

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

Cites Work

• 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 \(n=2k+2\)
• On hamiltonian cycles in the prism over the odd graphs
• Title not available (Why is that?)
• Hamiltonian paths in odd graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Odd Graphs Are Prism-Hamiltonian and Have a Long Cycle
• An inductive construction for Hamilton cycles in Kneser graphs

Cited In (2)

• On generalized middle-level problem
• An update on the middle levels problem

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)