Gray code enumeration of families of integer partitions
From MaRDI portal
Publication:1805052
DOI10.1016/0097-3165(95)90090-XzbMATH Open0824.05004MaRDI QIDQ1805052FDOQ1805052
David J. Rasmussen, Douglas B. West, Carla D. Savage
Publication date: 9 November 1995
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Recommendations
- Gray code sequences of partitions
- A Gray code for set partitions
- Gray codes for noncrossing and nonnesting partitions of classical types
- Gray codes, loopless algorithm and partitions
- scientific article; zbMATH DE number 5975298
- scientific article; zbMATH DE number 731846
- \(m\)-compositions and \(m\)-partitions: exhaustive generation and Gray code
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- Gray code enumeration of plane straight-line graphs
- Some remarks on the combinatories of Gray codes
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorial codes (94B25) Elementary theory of partitions (11P81)
Cites Work
- Generating linear extensions of posets by transpositions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating Linear Extensions Fast
- On Rotations and the Generation of Binary Trees
- Generation of Permutations by Adjacent Transposition
- Efficient generation of the binary reflected gray code and its applications
- Gray code sequences of partitions
- Adjacent interchange generation of combinations
- Gray codes for reflection groups
- Generating the Linear Extensions of Certain Posets by Transpositions
- Bijective proofs of some classical partition identities
- Generating linear extensions by adjacent transpositions
- Hamilton Paths in Graphs of Linear Extensions for Unions of Posets
Cited In (9)
- Gray code sequences of partitions
- Gray code enumeration of plane straight-line graphs
- Gray codes, loopless algorithm and partitions
- Title not available (Why is that?)
- Gray codes for noncrossing and nonnesting partitions of classical types
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- A Gray code for set partitions
- Title not available (Why is that?)
- Combinatorial families that are exponentially far from being listable in Gray code sequence
This page was built for publication: Gray code enumeration of families of integer partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805052)
