Partially directed animals with a bounded number of holes
From MaRDI portal
Publication:2232260
DOI10.1007/978-3-030-68195-1_2OpenAlexW3131565278MaRDI QIDQ2232260
Paolo Massazza, Valentina Dorigatti
Publication date: 4 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-68195-1_2
Uses Software
Cites Work
- On the exhaustive generation of \(k\)-convex polyominoes
- On the generation of 2-polyominoes
- Directed animals, forests and permutations
- Algebraic languages and polyominoes enumeration
- From Tetris to polyominoes generation
- On the generation and enumeration of some classes of convex polyominoes
- A method for the enumeration of various classes of column-convex polygons
- On the generation of convex polyominoes
- Hole-free partially directed animals
- The number of Z-convex polyominoes
- Reconstruction of L-convex Polyominoes
- From Linear Partitions to Parallelogram Polyominoes
- An Efficient Algorithm for the Generation of Z-Convex Polyominoes
- Checker Boards and Polyominoes
- Enumerations of lattice animals and trees
This page was built for publication: Partially directed animals with a bounded number of holes
