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.
Similar content being viewed by others
References
C. Berge,Graphs and hypergraphs, North-Holland, Amsterdam, 1973.
S. Chaiken, D. J. Kleitman, M. Saks andJ. Shearer, Covering regions by rectangles,SIAM J. Discrete and Algebraic Methods, to appear.
S. W. Golomb,Polyominoes, Charles Scribner’s Sons, New York, 1965.