A minimum-change version of the Chung-Feller theorem for Dyck paths
From MaRDI portal
Publication:5915781
DOI10.1016/j.ejc.2017.11.003zbMath1376.05075OpenAlexW2295541614MaRDI QIDQ5915781
Torsten Mütze, Veit Wiechert, Christoph Standke
Publication date: 21 December 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2017.11.003
Related Items
A short proof of the middle levels theorem, A constant-time algorithm for middle levels Gray codes, Sparse Kneser graphs are Hamiltonian
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An Eades-McKay algorithm for well-formed parentheses strings
- Construction of 2-factors in the middle layer of the discrete cube
- Long cycles in the middle two layers of the discrete cube
- On generalized Dyck paths
- An inductive construction for Hamilton cycles in Kneser graphs
- 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
- Hamiltonian uniform subset graphs
- 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
- Triangle-free Hamiltonian Kneser graphs
- Hamiltonian Kneser graphs
- Explicit 2-factorizations of the odd graph
- Monotone Gray codes and the middle levels problem
- The Rugby footballers of Croam
- Kneser graphs are Hamiltonian for \(n\geq 3k\)
- Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets
- Gallai-colorings of triples and 2-factors of \(\mathcal{B}_3\)
- The Chung-Feller theorem revisited
- The prism over the middle-levels graph is Hamiltonian
- Refined Chung-Feller theorems for lattice paths
- Uniform Partitions of Lattice Paths and Chung-Feller Generalizations
- Proof of the middle levels conjecture
- Some Hamilton Paths and a Minimal Change Algorithm
- Efficient Computation of Middle Levels Gray Codes
- Generating binary trees by transpositions
- Generalizations of Chung-Feller Theorem
- Efficient generation of the binary reflected gray code and its applications
- Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time
- A Survey of Combinatorial Gray Codes
- A constant-time algorithm for middle levels Gray codes
- Catalan Numbers
- Adjacent interchange generation of combinations
- Distance-2 Cyclic Chaining of Constant-Weight Codes
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- On Fluctuations in Coin-Tossing
- Galton's Rank-Order Test
- Bipartite Kneser graphs are Hamiltonian
- Magical Mathematics
