Gray codes for column-convex polyominoes and a new class of distributive lattices

DOI10.1016/j.disc.2007.11.038zbMath1193.05055OpenAlexW2002933371MaRDI QIDQ1044890

Frank Ruskey, Stirling Chow

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.038

zbMATH Keywords

distributive latticepolyominoHamilton cycleGray code

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Polyominoes (05B50)

Related Items (2)

Efficient generation of the ideals of a poset in Gray code order. II ⋮ On the generation of convex polyominoes

Uses Software

• OEIS

Cites Work

• Counting polyominoes: yet another attack
• Counting lattice animals: A parallel attack
• Gray codes from antimatroids
• On the existence of Hamiltonian paths in the cover graph of \(M\)(\(n\))
• Statistics of lattice animals (polyominoes) and polygons
• The On-Line Encyclopedia of Integer Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Gray codes for column-convex polyominoes and a new class of distributive lattices