Counting \(k\)-convex polyominoes

zbMath1295.05019MaRDI QIDQ396773

Dominique Rossin, Anne Micheli

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p56

zbMATH Keywords

convex polyominoes

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16) Polyominoes (05B50)

Related Items (2)

On computing the degree of convexity of polyominoes ⋮ On the exhaustive generation of \(k\)-convex polyominoes

Cites Work

• Unnamed Item
• Algebraic languages and polyominoes enumeration
• Convex n-ominoes
• The number of Z-convex polyominoes
• Enumeration of L-convex polyominoes by rows and columns
• Reconstruction of L-convex Polyominoes
• A Procedure for Improving the Upper Bound for the Number of n-Ominoes
• Checker Boards and Polyominoes

This page was built for publication: Counting \(k\)-convex polyominoes