Skip to main content
Log in

Combinatorial properties of polyominoes

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

A finite set of cells in the infinite planar square grid is often called a polyomino. With each polyominoP, we may associate a hypergraph whose vertices are the cells ofP and whose edges are the maximal rectangles (in the standard position) contained inP. It turns out that these hypergraphs have many nice properties generalizing various properties of bipartite graphs and trees. We survey results in this direction.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. C. Berge,Graphs and hypergraphs, North-Holland, Amsterdam, 1973.

    Google Scholar 

  2. S. Chaiken, D. J. Kleitman, M. Saks andJ. Shearer, Covering regions by rectangles,SIAM J. Discrete and Algebraic Methods, to appear.

  3. S. W. Golomb,Polyominoes, Charles Scribner’s Sons, New York, 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Berge, C., Chen, C.C., Chvátal, V. et al. Combinatorial properties of polyominoes. Combinatorica 1, 217–224 (1981). https://doi.org/10.1007/BF02579327

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02579327

AMS subject classification (1980)

Navigation