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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
