Covering a Rectangle with T-Tetrominoes

DOI10.2307/2313337MaRDI QIDQ5340930zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

combinatorics

Cited in

(15)

• Polyomino convolutions and tiling problems
• On tilings by ribbon tetrominoes
• Generalized dominoes tiling's Markov chain mixes fast
• 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
• Tiling with polyominoes and combinatorial group theory
• T-tetrominos in arithmetic progression
• Tile invariants: New horizons.
• Combinatorial settlement planning
• 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)