The following pages link to (Q4325282):
Displayed 9 items.
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) (← links)
- Loop-free Gray code algorithms for the set of compositions (Q655198) (← links)
- Gray codes for reflectable languages (Q976101) (← links)
- Gray codes for non-crossing partitions and dissections of a convex polygon (Q1028124) (← links)
- Gray codes, loopless algorithm and partitions (Q1040787) (← links)
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions (Q1944946) (← links)
- Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs (Q2331438) (← links)
- Efficient generation of restricted growth words (Q2444851) (← links)
- Tracing Isomanifolds in \(\mathbb{R}\) <sup><i>d</i></sup> in Time Polynomial in <i>d</i> using Coxeter–Freudenthal–Kuhn Triangulations (Q5890033) (← links)