Packing a rectangle with congruent N-ominoes

D.A. Klarner

Research output: Contribution to journalArticleAcademicpeer-review

32 Citations (Scopus)

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 languageEnglish
Pages (from-to)107-115
Number of pages9
JournalJournal of Combinatorial Theory
Volume7
Issue number2
DOIs
Publication statusPublished - 1969

Fingerprint Dive into the research topics of 'Packing a rectangle with congruent N-ominoes'. Together they form a unique fingerprint.

Cite this