Packing a rectangle with congruent N-ominoes
From MaRDI portal
Publication:5562011
DOI10.1016/S0021-9800(69)80044-XzbMath0174.04102OpenAlexW2085794924MaRDI QIDQ5562011
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80044-x
Related Items (21)
An octomino of high order ⋮ Tiling with arbitrary tiles ⋮ Tiling rectangles with polyominoes ⋮ Tiling rectangles and half strips with congruent polyominoes ⋮ Smooth column convex polyominoes ⋮ Polyominoes on the infinite checkerboard ⋮ Many L-shaped polyominoes have odd rectangular packings ⋮ A neural network approach to tiling problems ⋮ Packing cube nets into rectangles with \(O(1)\) holes ⋮ Generating functions for straight polyomino tilings of narrow rectangles ⋮ Polyominoes of order 3 do not exist ⋮ Klarner systems and tiling boxes with polyominoes ⋮ Rectangular tileability and complementary tileability are undecidable ⋮ A Partition Theory of Planar Animals ⋮ The Y-hexomino has order 92 ⋮ Tilings ⋮ Tilings ⋮ Polyominoes tiling by a genetic algorithm ⋮ Polyominoes which tile rectangles ⋮ On column-convex and convex Carlitz polyominoes ⋮ A new mathematical model for tiling finite regions of the plane with polyominoes
This page was built for publication: Packing a rectangle with congruent N-ominoes
