On generalized middle-level problem
From MaRDI portal
Publication:985072
DOI10.1016/J.INS.2010.02.009zbMATH Open1225.05157OpenAlexW2084858300MaRDI QIDQ985072FDOQ985072
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
Recommendations
Cites Work
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
- Path partitions of hypercubes
- An update on the middle levels problem
- The prism over the middle-levels graph is Hamiltonian
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spanning multi-paths in hypercubes
- Monotone Gray codes and the middle levels problem
- Long cycles in the middle two layers of the discrete cube
- A note on Frucht diagrams, Boolean graphs and Hamilton cycles
- Boolean layer cakes
- The antipodal layers problem
- Title not available (Why is that?)
Cited In (13)
- Bipartite Kneser graphs are Hamiltonian
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A minimum-change version of the Chung-Feller theorem for Dyck paths
- An update on the middle levels problem
- Proof of the middle levels conjecture
- Bipartite Kneser graphs are Hamiltonian
- On a Combinatorial Generation Problem of Knuth
- Gray codes and symmetric chains
- Trimming and gluing Gray codes
- On the central levels problem
- A constant-time algorithm for middle levels Gray codes
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)
