The following pages link to (Q2721325):
Displayed 14 items.
- Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
- Gray codes for signed involutions (Q724881) (← 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)
- Generating restricted classes of involutions, Bell and Stirling permutations (Q966165) (← links)
- More restrictive Gray codes for some classes of pattern avoiding permutations (Q989488) (← links)
- A general exhaustive generation algorithm for Gray structures (Q995753) (← links)
- Gray codes, loopless algorithm and partitions (Q1040787) (← 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)
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions (Q1944946) (← links)
- Optimal Gray code for involutions (Q2419799) (← links)