The following pages link to Combinatorial Gray Codes (Q3898504):
Displaying 18 items.
- Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes (Q343754) (← links)
- On the maximum disjoint paths problem on edge-colored graphs (Q435732) (← links)
- Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
- Gray code orders for \(q\)-ary words avoiding a given factor (Q748433) (← links)
- Gray-Codes (Q1055391) (← links)
- Gray codes in graphs of subsets (Q1147162) (← links)
- Gray codes from antimatroids (Q1318347) (← links)
- Weak-order extensions of an order. (Q1401400) (← links)
- Gray codes for reflection groups (Q1825283) (← links)
- A loop-free algorithm for generating the linear extensions of a poset (Q1917670) (← links)
- Restricted compositions and permutations: from old to new Gray codes (Q1944104) (← links)
- Variable-length codes independent or closed with respect to edit relations (Q2084770) (← links)
- Gray cycles of maximum length related to \(k\)-character substitutions (Q2096591) (← links)
- Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order (Q2321597) (← links)
- Combinatorial isomorphism between Fibonacci classes (Q3520618) (← links)
- (Q4318151) (← links)
- Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity (Q5009569) (← links)
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708) (← links)
