Tiling a Manhattan polyomino with bars. (English)
Nešetřil, Jaroslav (ed.) et al., Comb01—Euroconference on combinatorics, graph theory and applications. Extended abstracts from the conference, Barcelona, Spain, September 12‒15, 2001. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 10, 27-29 (2001).
Summary: A Manhattan polyomino, is a finite union of integer rectangles put on a same line. We give a simple characterization of Manhattan polyominoes which can be tiled by rectangles ${1 \times p, q, \times 1}$ and consequently a linear time (with short encoding) algorithm to decide if a Manhattan polyomino is tilable by ${1 \times p, q, \times 1}$.
Start
Contact
Print
General Help
