The following pages link to (Q4268449):
Displayed 15 items.
- An Eades-McKay algorithm for well-formed parentheses strings (Q293461) (← links)
- Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
- A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words (Q866549) (← links)
- Gray code for permutations with a fixed number of cycles (Q879329) (← links)
- Combinatorial Gray codes for classes of pattern avoiding permutations (Q924132) (← links)
- The rotation graph of \(k\)-ary trees is Hamiltonian (Q975545) (← links)
- The coolest way to generate combinations (Q1044892) (← links)
- Gray code for derangements (Q1827847) (← links)
- A loopless algorithm for generating the permutations of a multiset (Q1885026) (← links)
- Counting and computing the Rand and block distances of pairs of set partitions (Q1932369) (← links)
- Gray codes for Fibonacci \(q\)-decreasing words (Q2163389) (← links)
- Efficient generation of restricted growth words (Q2444851) (← links)
- Gray code enumeration of plane straight-line graphs (Q2464050) (← links)
- A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
- A trace partitioned Gray code for<i>q</i>-ary generalized Fibonacci strings (Q5069743) (← links)