Packing a rectangle with congruent N-ominoes

DOI10.1016/S0021-9800(69)80044-XMaRDI QIDQ5562011zbMATH OpenOpenAlexFDO

Authors David A. Klarner

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

zbMATH Keywords

combinatorics

Cited in

(21)

• Tilings
• Tiling rectangles with polyominoes
• Polyominoes which tile rectangles
• Many L-shaped polyominoes have odd rectangular packings
• A new mathematical model for tiling finite regions of the plane with polyominoes
• Klarner systems and tiling boxes with polyominoes
• Tiling rectangles and half strips with congruent polyominoes
• Polyominoes on the infinite checkerboard
• Rectangular tileability and complementary tileability are undecidable
• A Partition Theory of Planar Animals
• Tiling with arbitrary tiles
• The Y-hexomino has order 92
• A neural network approach to tiling problems
• Polyominoes tiling by a genetic algorithm
• An octomino of high order
• On column-convex and convex Carlitz polyominoes
• Smooth column convex polyominoes
• Tilings
• Packing cube nets into rectangles with O(1) holes
• Polyominoes of order 3 do not exist
• Generating functions for straight polyomino tilings of narrow rectangles

This page was built for publication: Packing a rectangle with congruent N-ominoes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5562011)