Pages that link to "Item:Q5441544"
From MaRDI portal
The following pages link to An algorithm for deciding if a polyomino tiles the plane (Q5441544):
Displaying 11 items.
- Non-lattice-periodic tilings of \(\mathbb R^3\) by single polycubes (Q428854) (← links)
- Rectangular tileability and complementary tileability are undecidable (Q740261) (← links)
- On the tiling by translation problem (Q1003706) (← links)
- Small polyomino packing (Q2361496) (← links)
- Tiling the Plane with a Fixed Number of Polyominoes (Q3618618) (← links)
- ENUMERATION OF n-CONNECTED OMINOES INSCRIBED IN AN ABACUS (Q5075065) (← links)
- (Q5136219) (← links)
- On the Number of p4-Tilings by an n-Omino (Q5234038) (← links)
- (Q5239738) (← links)
- Proving a conjecture on prime double square tiles (Q6126720) (← links)
- On the number of isohedral polyominoes (Q6570128) (← links)
