The following pages link to A Gray code for set partitions (Q1239129):
Displaying 17 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)
- Gray codes for non-crossing partitions and dissections of a convex polygon (Q1028124) (← links)
- Gray codes, loopless algorithm and partitions (Q1040787) (← links)
- Gray codes for column-convex polyominoes and a new class of distributive lattices (Q1044890) (← links)
- Rekursive Erzeugung aller Partitionen einer endlichen Menge (Q1059080) (← links)
- Gray code enumeration of families of integer partitions (Q1805052) (← links)
- Gray codes for reflection groups (Q1825283) (← links)
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions (Q1944946) (← links)
- Gray cycles of maximum length related to \(k\)-character substitutions (Q2096591) (← links)
- Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs (Q2331438) (← links)
- The Greedy Gray Code Algorithm (Q2842188) (← links)
- (Q3098785) (← links)
- Infinite-Valued First-Order Łukasiewicz Logic: Hypersequent Calculi Without Structural Rules and Proof Search for Sentences in the Prenex Form (Q4558324) (← links)
- Gray codes for noncrossing and nonnesting partitions of classical types (Q5365322) (← links)
- Combinatorial generation via permutation languages. I. Fundamentals (Q5863047) (← links)
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708) (← links)
