Trimming and gluing Gray codes
From MaRDI portal
Publication:1694730
DOI10.1016/j.tcs.2017.12.003zbMath1387.05251arXiv1607.08806OpenAlexW2495998649WikidataQ64148774 ScholiaQ64148774MaRDI QIDQ1694730
Publication date: 6 February 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.08806
Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial codes (94B25) Eulerian and Hamiltonian graphs (05C45)
Related Items (5)
Unnamed Item ⋮ On the central levels problem ⋮ A short proof of the middle levels theorem ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Gray codes and symmetric chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of 2-factors in the middle layer of the discrete cube
- The coolest way to generate binary strings
- Long cycles in the middle two layers of the discrete cube
- On generalized middle-level problem
- An update on the middle levels problem
- An algorithm for generating subsets of fixed size with a strong minimal change property
- Gray codes with restricted density
- Lexicographic matchings cannot form Hamiltonian cycles
- Explicit matchings in the middle levels of the Boolean lattice
- An explicit 1-factorization in the middle of the Boolean lattice
- Monotone Gray codes and the middle levels problem
- Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets
- The prism over the middle-levels graph is Hamiltonian
- Proof of the middle levels conjecture
- Some Hamilton Paths and a Minimal Change Algorithm
- Efficient Computation of Middle Levels Gray Codes
- Efficient generation of the binary reflected gray code and its applications
- A Survey of Combinatorial Gray Codes
- A constant-time algorithm for middle levels Gray codes
- Adjacent interchange generation of combinations
- Distance-2 Cyclic Chaining of Constant-Weight Codes
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Bipartite Kneser graphs are Hamiltonian
- Magical Mathematics
This page was built for publication: Trimming and gluing Gray codes
