Tessellating polyominos in the plane
From MaRDI portal
Publication:2497495
Recommendations
Cites work
- A Combinatorial Problem Related to Multimodule Memory Organizations
- A complementary survey on double-loop networks
- A simple algorithm to find the steps of double-loop networks
- Double commutative-step digraphs with minimum diameters
- scientific article; zbMATH DE number 4004216 (Why is no real title available?)
- Reaching fault diagnosis agreement under a hybrid fault model
Cited in
(14)- Tesselations of multidimensional parallelepipeds
- Some open problems in polyomino tilings
- Planar tilings by polyominoes, polyhexes, and polyiamonds
- From solid to plane tessellations, and back
- THE CHARACTER OF PLANAR TESSELLATIONS WHICH ARE NOT SIDE-TO-SIDE
- Tessellations
- A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino
- Tetromino tilings and the Tutte polynomial
- Tiling the Plane with a Fixed Number of Polyominoes
- scientific article; zbMATH DE number 6897879 (Why is no real title available?)
- scientific article; zbMATH DE number 7278912 (Why is no real title available?)
- The polyhedral Tammes problem
- Versatile topology for two-dimensional cellular automata
- Polyomino coloring and complex numbers
This page was built for publication: Tessellating polyominos in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497495)