Gray code enumeration of families of integer partitions
From MaRDI portal
Publication:1805052
DOI10.1016/0097-3165(95)90090-XzbMath0824.05004MaRDI QIDQ1805052
Douglas B. West, Carla D. Savage, David J. Rasmussen
Publication date: 9 November 1995
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Combinatorial codes (94B25)
Cites Work
- Unnamed Item
- Unnamed Item
- Bijective proofs of some classical partition identities
- Generating linear extensions by adjacent transpositions
- Gray codes for reflection groups
- Generating linear extensions of posets by transpositions
- Gray code sequences of partitions
- Generating the Linear Extensions of Certain Posets by Transpositions
- Hamilton Paths in Graphs of Linear Extensions for Unions of Posets
- Efficient generation of the binary reflected gray code and its applications
- On Rotations and the Generation of Binary Trees
- Generating Linear Extensions Fast
- Adjacent interchange generation of combinations
- Generation of Permutations by Adjacent Transposition
This page was built for publication: Gray code enumeration of families of integer partitions
