Tiling complexity of small n-ominoes (N<10)
From MaRDI portal
Publication:1114701
DOI10.1016/0012-365X(88)90081-7zbMATH Open0663.05023OpenAlexW1968163400WikidataQ56112483 ScholiaQ56112483MaRDI QIDQ1114701FDOQ1114701
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Checker Boards and Polyominoes
- Title not available (Why is that?)
- The Plane Symmetry Groups: Their Recognition and Notation
- Tiling with sets of polyominoes
- Tiling with polyominoes
- Title not available (Why is that?)
- Tiling the Plane with Congruent Pentagons
- On Paving the Plane
- Convex Polygons that Cannot Tile the Plane
- Will It Tile? Try the Conway Criterion!
- Tilings with congruent tiles
- The eighty-one types of isohedral tilings in the plane
- Replicating Figures in the Plane
- An enneamorphic prototile
- Tetramorphic and pentamorphic prototiles
- Polymorphic prototiles
- Polymorphic Polyominoes
- Title not available (Why is that?)
- Etalements cristallographiques
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Tiling complexity of small n-ominoes \((N<10)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114701)