Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-25T05:39:46.975Z Has data issue: false hasContentIssue false
  • English
  • Français

Contributions to the Cell Growth Problem

Published online by Cambridge University Press:  20 November 2018

R. C. Read
R. C. Read*
Affiliation:
University College of the West Indies, Kingston, Jamaica
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The cell growth problem is a combinatorial problem which may be stated as follows: A plane animal is made up of cells, each of which is a square of unit area. It starts as a single cell, and grows by adding cells one at a time in such a way that the new cell has at least one side in contact with a side of a cell already present in the animal. The problem is to find the number of different animals of area n, it being understood that animals which can be transformed into each other by reflections or rotations of the plane will be regarded as the same animal.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 14 , 1962 , pp. 1 - 20
Copyright
Copyright © Canadian Mathematical Society 1962

References

1. Golomb, S. W., Checker boards and polyominoes, Amer. Math. Monthly, 61 (1954), 675–682.Google Scholar
2. Harary, F., Unsolved problems in the enumeration of graphs, Publ. Math. Inst. Hungarian Acad. Sci., 5 (1960), 63–95.Google Scholar