Combinatorics and Graph Theory


Corrigendum to "Polyomino Enumeration Results. (Parkin et Al., Siam Fall Meeting 1967)"

Authors: Richard J. Mathar

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 16-ominoes and partially to even larger polyominoes.

Comments: 17 Pages.

Download: PDF

Submission history

[v1] 2019-05-23 09:15:36

Unique-IP document downloads: 17 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus