On generalized middle-level problem

DOI10.1016/J.INS.2010.02.009MaRDI QIDQ985072zbMATHOpenAlexFDO

Authors Petr Gregor, Riste Škrekovski

Publication date 20 July 2010

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2010.02.009

zbMATH Keywords

hypercubeHamiltonian cyclemiddle-level problem

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Proof of the middle levels conjecture
• An update on the middle levels problem
• A note on the middle levels problem
• The antipodal layers problem
• scientific article; zbMATH DE number 1439443

Cites work

• scientific article; zbMATH DE number 3838053 (Why is no real title available?)
• scientific article; zbMATH DE number 1743965 (Why is no real title available?)
• scientific article; zbMATH DE number 1439443 (Why is no real title available?)
• A note on Frucht diagrams, Boolean graphs and Hamilton cycles
• An update on the middle levels problem
• Boolean layer cakes
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Long cycles in the middle two layers of the discrete cube
• Monotone Gray codes and the middle levels problem
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Path partitions of hypercubes
• Spanning multi-paths in hypercubes
• The antipodal layers problem
• The prism over the middle-levels graph is Hamiltonian

Cited in

(17)

• An update on the middle levels problem
• Bipartite Kneser graphs are Hamiltonian
• On a combinatorial generation problem of Knuth
• scientific article; zbMATH DE number 3916312 (Why is no real title available?)
• Trimming and gluing Gray codes
• Proof of the middle levels conjecture
• The \(q\)-analog of the middle levels problem
• scientific article; zbMATH DE number 1990668 (Why is no real title available?)
• Gray codes and symmetric chains
• Gray codes and symmetric chains
• A minimum-change version of the Chung-Feller theorem for Dyck paths
• A short proof of the middle levels theorem
• A constant-time algorithm for middle levels Gray codes
• A book proof of the middle levels theorem
• Bipartite Kneser graphs are Hamiltonian
• On the central levels problem
• A note on the middle levels problem

This page was built for publication: On generalized middle-level problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985072)