Pages that link to "Item:Q1805053"
From MaRDI portal
The following pages link to Monotone Gray codes and the middle levels problem (Q1805053):
Displaying 34 items.
- The \(q\)-analog of the middle levels problem (Q397158) (← links)
- Hamiltonian cycles and symmetric chains in Boolean lattices. (Q489325) (← links)
- The coolest way to generate binary strings (Q489746) (← links)
- On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric (Q522220) (← links)
- Long cycles in the middle two layers of the discrete cube (Q598456) (← links)
- A construction of Gray codes inducing complete graphs (Q941339) (← links)
- On generalized middle-level problem (Q985072) (← links)
- On the \((n,t)\)-antipodal Gray codes (Q1022591) (← links)
- An update on the middle levels problem (Q1044886) (← links)
- Gray codes with restricted density (Q1062075) (← links)
- Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups (Q1403877) (← links)
- Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups (Q1403878) (← links)
- Triangle-free Hamiltonian Kneser graphs (Q1410728) (← links)
- Trimming and gluing Gray codes (Q1694730) (← links)
- Antipodal Gray codes (Q1827713) (← links)
- Kneser graphs are Hamiltonian for \(n\geq 3k\) (Q1850485) (← links)
- Gray codes and symmetric chains (Q2072179) (← links)
- A constant-time algorithm for middle levels Gray codes (Q2309469) (← links)
- The first three levels of an order preserving Hamiltonian path in the subset lattice (Q2390974) (← links)
- On the central levels problem (Q2692785) (← links)
- Proof of the middle levels conjecture (Q2809275) (← links)
- Hamiltonian cycles in Kneser graphs for \(n=2k+2\) (Q2840725) (← links)
- Gray codes and overlap cycles for restricted weight words (Q2931928) (← links)
- Permutational labelling of constant weight Gray codes (Q3149456) (← links)
- Efficient Computation of Middle Levels Gray Codes (Q3452851) (← links)
- Efficient Computation of Middle Levels Gray Codes (Q4554342) (← links)
- Trimming and gluing Gray codes (Q4636639) (← links)
- A short proof of the middle levels theorem (Q4645033) (← links)
- (Q5002744) (← links)
- On a Combinatorial Generation Problem of Knuth (Q5080484) (← links)
- Bipartite Kneser graphs are Hamiltonian (Q5890906) (← links)
- Bipartite Kneser graphs are Hamiltonian (Q5895045) (← links)
- A minimum-change version of the Chung-Feller theorem for Dyck paths (Q5915781) (← links)
- Minimal enumerations of subsets of a finite set and the middle level problem (Q5954085) (← links)
