Recommendations
Cites work
- 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers
- A method for the enumeration of various classes of column-convex polygons
- A Procedure for Improving the Upper Bound for the Number of n-Ominoes
- Checker Boards and Polyominoes
- Coding the convex polyominoes and equations for the enumeration according to the area
- Counting polyominoes: yet another attack
- Enumeration of polyominoes inscribed in a rectangle
- Enumerations of lattice animals and trees
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 687006 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- New enumerative results on two-dimensional directed animals
- On the number of certain lattice polygons
- On translating one polyomino to tile the plane
- Polyominoes with minimum site-perimeter and full set achievement games
- Statistics of lattice animals (polyominoes) and polygons
- The site-perimeter of bargraphs
- Tilings by translation: enumeration by a rational language approach
Cited in
(6)- From Tetris to polyominoes generation
- Polyominoes with minimum site-perimeter and full set achievement games
- scientific article; zbMATH DE number 4191671 (Why is no real title available?)
- Enumeration of inscribed polyominos
- On the exhaustive generation of discrete figures with connectivity constraints
- On the generation of 2-polyominoes
This page was built for publication: Exhaustive generation of gominoes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391401)