Monotone Gray codes and the middle levels problem
From MaRDI portal
Publication:1805053
DOI10.1016/0097-3165(95)90091-8zbMath0827.05039OpenAlexW2029196217WikidataQ56084127 ScholiaQ56084127MaRDI QIDQ1805053
Carla D. Savage, Peter M. Winkler
Publication date: 27 November 1995
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(95)90091-8
Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15) Eulerian and Hamiltonian graphs (05C45)
Related Items
Efficient Computation of Middle Levels Gray Codes, On a Combinatorial Generation Problem of Knuth, Gray codes and overlap cycles for restricted weight words, Long cycles in the middle two layers of the discrete cube, The \(q\)-analog of the middle levels problem, Trimming and gluing Gray codes, Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups, Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups, Unnamed Item, On the central levels problem, Triangle-free Hamiltonian Kneser graphs, Bipartite Kneser graphs are Hamiltonian, Bipartite Kneser graphs are Hamiltonian, Hamiltonian cycles and symmetric chains in Boolean lattices., The coolest way to generate binary strings, A construction of Gray codes inducing complete graphs, A short proof of the middle levels theorem, On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric, On generalized middle-level problem, Minimal enumerations of subsets of a finite set and the middle level problem, A minimum-change version of the Chung-Feller theorem for Dyck paths, Proof of the middle levels conjecture, On the \((n,t)\)-antipodal Gray codes, A constant-time algorithm for middle levels Gray codes, Gray codes and symmetric chains, Antipodal Gray codes, Hamiltonian Cycles in Kneser Graphs for, An update on the middle levels problem, Kneser graphs are Hamiltonian for \(n\geq 3k\), Permutational labelling of constant weight Gray codes
Cites Work
- Lexicographic matchings cannot form Hamiltonian cycles
- Explicit matchings in the middle levels of the Boolean lattice
- A technique for generating Gray codes
- The antipodal layers problem
- Long cycles in vertex-transitive graphs
- A Technique for Generating Specialized Gray Codes
- Efficient generation of the binary reflected gray code and its applications
- Optimal numberings and isoperimetric problems on graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
