The following pages link to Gray visiting Motzkins (Q1403332):
Displayed 8 items.
- Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
- Gray code for permutations with a fixed number of cycles (Q879329) (← links)
- Combinatorial Gray codes for classes of pattern avoiding permutations (Q924132) (← 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 code for derangements (Q1827847) (← links)
- On the reconstruction of a Motzkin Tree from its code (Q4469167) (← links)
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708) (← links)