The following pages link to Gray code for derangements (Q1827847):
Displayed 20 items.
- Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
- 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 signed involutions (Q724881) (← 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)
- On fixed points of permutations. (Q1024810) (← 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)
- Efficient linear-time ranking and unranking of derangements (Q2094363) (← links)
- Efficient generation of random derangements with the expected distribution of cycle lengths (Q2204174) (← links)
- Constant time generation of derangements (Q2390248) (← links)
- Lexicographic ranking and unranking of derangements in cycle notation (Q2636806) (← links)
- Listing combinatorial objects in parallel (Q3378053) (← links)
- Hamiltonian paths for involutions in the square of a Cayley graph (Q5446252) (← links)
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708) (← links)