Pages that link to "Item:Q3028353"
From MaRDI portal
The following pages link to Some Hamilton Paths and a Minimal Change Algorithm (Q3028353):
Displaying 15 items.
- An Eades-McKay algorithm for well-formed parentheses strings (Q293461) (← links)
- The coolest way to generate combinations (Q1044892) (← links)
- An algorithm for generating subsets of fixed size with a strong minimal change property (Q1060849) (← links)
- Solution of some multi-dimensional lattice path parity difference recurrence relations (Q1264151) (← links)
- On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains (Q1331990) (← links)
- Trimming and gluing Gray codes (Q1694730) (← links)
- A generalized permutahedron (Q1905997) (← links)
- A constant-time algorithm for middle levels Gray codes (Q2309469) (← links)
- The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations (Q2364644) (← links)
- Generating linear extensions of posets by transpositions (Q2368024) (← links)
- On a Combinatorial Generation Problem of Knuth (Q5080484) (← links)
- Rainbow Cycles in Flip Graphs. (Q5115806) (← links)
- Rainbow Cycles in Flip Graphs (Q5208641) (← links)
- A minimum-change version of the Chung-Feller theorem for Dyck paths (Q5915781) (← links)
- Star transposition Gray codes for multiset permutations (Q6074576) (← links)