Covering Regions with Squares
Authors:
- Michael O. AlbertsonMAMichael O. Albertson
- Claire J. O’kEefeCOClaire J. O’kEefe
- 1 September 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 2 (3) , 240-243
Abstract
A unit square in $R^2 $ whose corners are integer lattice points is called a block. A board consists of a finite set of blocks. Given a board B, its graph $G(B)$ has vertices corresponding with the blocks of B, and two vertices of $G(B)$ are joined by an edge provided the corresponding blocks are contained in a square subset of B. If B is simply connected, then $G(B)$ is perfect.
Keywords
This publication has 2 references indexed in Scilit:
- Covering Regions by RectanglesSIAM Journal on Algebraic Discrete Methods, 1981
- A characterization of perfect graphsJournal of Combinatorial Theory, Series B, 1972