On a Combinatorial Generation Problem of Knuth
From MaRDI portal
Publication:5080484
DOI10.1137/20M1377394zbMath1490.05148arXiv2007.07164OpenAlexW3115943440MaRDI QIDQ5080484
Torsten Mütze, Arturo I. Merino, Ondřej Mička
Publication date: 31 May 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.07164
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Long cycles in the middle two layers of the discrete cube
- On generalized middle-level problem
- An update on the middle levels problem
- The coolest way to generate combinations
- Hamilton cycles and paths in vertex-transitive graphs-current directions
- Hamiltonian paths in Cayley graphs
- 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
- Lexicographically least circular substrings
- Some properties of a centroid of a free tree
- An explicit 1-factorization in the middle of the Boolean lattice
- Shorthand universal cycles for permutations
- Monotone Gray codes and the middle levels problem
- Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets
- A constant-time algorithm for middle levels Gray codes
- The prism over the middle-levels graph is Hamiltonian
- Proof of the middle levels conjecture
- Perfect Snake-in-the-Box Codes for Rank Modulation
- Some Hamilton Paths and a Minimal Change Algorithm
- Probabilistic combinatorics and the recent work of Peter Keevash
- Efficient generation of the binary reflected gray code and its applications
- Doubly adjacent gray codes for the symmetric group
- A Survey of Combinatorial Gray Codes
- A short proof of the middle levels theorem
- Adjacent interchange generation of combinations
- Sparse Kneser graphs are Hamiltonian
- Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
- Distance-2 Cyclic Chaining of Constant-Weight Codes
- Magical Mathematics
This page was built for publication: On a Combinatorial Generation Problem of Knuth
