Tiling complexity of small n-ominoes \((N<10)\)

DOI10.1016/0012-365X(88)90081-7zbMath0663.05023OpenAlexW1968163400WikidataQ56112483 ScholiaQ56112483MaRDI QIDQ1114701

Daniel A. Rawsthorne

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90081-7

zbMATH Keywords

polyominoesmonohedral plane tilingsn-ominoes

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)

Related Items (2)

Planar tilings by polyominoes, polyhexes, and polyiamonds ⋮ A new mathematical model for tiling finite regions of the plane with polyominoes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An enneamorphic prototile
• Tetramorphic and pentamorphic prototiles
• Polymorphic prototiles
• Polymorphic Polyominoes
• Will It Tile? Try the Conway Criterion!
• Tilings with congruent tiles
• Tiling with sets of polyominoes
• The eighty-one types of isohedral tilings in the plane
• Etalements cristallographiques
• The Plane Symmetry Groups: Their Recognition and Notation
• Convex Polygons that Cannot Tile the Plane
• Tiling the Plane with Congruent Pentagons
• Replicating Figures in the Plane
• Tiling with polyominoes
• On Paving the Plane
• Checker Boards and Polyominoes

This page was built for publication: Tiling complexity of small n-ominoes \((N<10)\)