Abstract
Golomb defines a polyomino (a generalized domino) to be a finite set of rook-wise connected cells in an infinite chessboard. In this note we discuss problems concerning the packing of rectangles with congruent polyomioes. Many of these problems are unsolved.
| Original language | English |
|---|---|
| Pages (from-to) | 107-115 |
| Number of pages | 9 |
| Journal | Journal of Combinatorial Theory |
| Volume | 7 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1969 |