Covering a Rectangle with T-Tetrominoes
From MaRDI portal
Publication:5340930
DOI10.2307/2313337zbMATH Open0132.00603OpenAlexW2005335081MaRDI QIDQ5340930FDOQ5340930
Authors: David W. Walkup 
Publication date: 1965
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2313337
Cited In (15)
- Polyomino convolutions and tiling problems
- On tilings by ribbon tetrominoes
- Generalized dominoes tiling's Markov chain mixes fast
- Title not available (Why is that?)
- Klarner systems and tiling boxes with polyominoes
- A polyomino tiling problem of Thurston and its configurational entropy
- A Partition Theory of Planar Animals
- The gap number of the \(T\)-tetromino
- Tilings of rectangles with T-tetrominoes
- T-tetrominos in arithmetic progression
- Tiling with polyominoes and combinatorial group theory
- Tile invariants: New horizons.
- T-tetrominoes Tiling's Markov chain mixes fast
- Planarity, symmetry and counting tilings
- Tetris and decidability
This page was built for publication: Covering a Rectangle with T-Tetrominoes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5340930)
