Polyominoes on the infinite checkerboard

DOI10.1016/0097-3165(80)90055-2zbMath0432.05001OpenAlexW2001958283MaRDI QIDQ1138550

S. H. Smith

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(80)90055-2

zbMATH Keywords

blocking setcongruence classminimal densitycollection of subsetspentominoes

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Enumerative combinatorics (05A99)

Related Items (5)

A neural network approach to tiling problems ⋮ Polyominoes tiling by a genetic algorithm ⋮ Barring rectangles from the plane ⋮ Barring Hexominoes from the Infinite Checkerboard ⋮ Barring the Z Pentomino from the Infinite Checkerboard

Cites Work

• Unnamed Item
• Unnamed Item
• On total covering and matching of graphs
• Tiling with polyominoes
• Packing a rectangle with congruent N-ominoes
• The Gunport Problem

This page was built for publication: Polyominoes on the infinite checkerboard