Combinatorics and Graph Theory

Corrigendum to "Polyomino Enumeration Results. (Parkin et al., SIAM Fall Meeting 1967)"

Authors: Richard J. Mathar
Comments: 39 Pages. Version 3 includes refined statistics according to perimeter.

This work provides a Java program which constructs free polyominoes of size n sorted by width and height of the convex hull (i.e., its rectangular bounding box). The results correct counts for 15-ominoes published in the 1967 proceedings of the SIAM Fall Meeting, and extend them to 17-ominoes and partially to even larger polyominoes. [vixra:1905.0474]
Category: Combinatorics and Graph Theory