On generalized middle-level problem

DOI10.1016/j.ins.2010.02.009zbMath1225.05157OpenAlexW2084858300MaRDI QIDQ985072

Riste Škrekovski, Petr Gregor

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)

Related Items (10)

On a Combinatorial Generation Problem of Knuth ⋮ Trimming and gluing Gray codes ⋮ Unnamed Item ⋮ On the central levels problem ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Proof of the middle levels conjecture ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Gray codes and symmetric chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Long cycles in the middle two layers of the discrete cube
• A note on Frucht diagrams, Boolean graphs and Hamilton cycles
• Path partitions of hypercubes
• An update on the middle levels problem
• Boolean layer cakes
• The antipodal layers problem
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Monotone Gray codes and the middle levels problem
• Spanning multi-paths in hypercubes
• The prism over the middle-levels graph is Hamiltonian
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices

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