A Gray code for set partitions

DOI10.1016/0020-0190(76)90014-4zbMath0357.94010OpenAlexW2024475703MaRDI QIDQ1239129

Richard W. Kaye

Publication date: 1976

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(76)90014-4

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Communication theory (94A05)

Related Items (9)

Infinite-Valued First-Order Łukasiewicz Logic: Hypersequent Calculi Without Structural Rules and Proof Search for Sentences in the Prenex Form ⋮ Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ Gray codes for non-crossing partitions and dissections of a convex polygon ⋮ Gray codes for reflection groups ⋮ Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs ⋮ Gray cycles of maximum length related to \(k\)-character substitutions ⋮ Rekursive Erzeugung aller Partitionen einer endlichen Menge ⋮ Combinatorial generation via permutation languages. I. Fundamentals

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A Gray code for set partitions