Covering a Rectangle with T-Tetrominoes

DOI10.2307/2313337zbMath0132.00603OpenAlexW2005335081MaRDI QIDQ5340930

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

Related Items (15)

GENERALIZED DOMINOES TILING'S MARKOV CHAIN MIXES FAST ⋮ Tilings of rectangles with T-tetrominoes ⋮ Planarity, symmetry and counting tilings ⋮ Tile invariants: New horizons. ⋮ T-tetrominoes Tiling's Markov chain mixes fast ⋮ T-tetrominos in arithmetic progression ⋮ Unnamed Item ⋮ The gap number of the \(T\)-tetromino ⋮ Klarner systems and tiling boxes with polyominoes ⋮ Polyomino convolutions and tiling problems ⋮ A polyomino tiling problem of Thurston and its configurational entropy ⋮ A Partition Theory of Planar Animals ⋮ On tilings by ribbon tetrominoes ⋮ Tiling with polyominoes and combinatorial group theory ⋮ Tetris and decidability

This page was built for publication: Covering a Rectangle with T-Tetrominoes