On generalized middle-level problem
From MaRDI portal
Publication:985072
DOI10.1016/j.ins.2010.02.009zbMath1225.05157MaRDI QIDQ985072
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
05C45: Eulerian and Hamiltonian graphs
Related Items
Unnamed Item, On a Combinatorial Generation Problem of Knuth, Bipartite Kneser graphs are Hamiltonian, Bipartite Kneser graphs are Hamiltonian, A minimum-change version of the Chung-Feller theorem for Dyck paths, Trimming and gluing Gray codes, Gray codes and symmetric chains, A constant-time algorithm for middle levels Gray codes, On the central levels problem, Proof of the middle levels conjecture
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