Tiling with polyominoes
From MaRDI portal
Publication:5519795
DOI10.1016/S0021-9800(66)80033-9zbMath0143.44202WikidataQ56112482 ScholiaQ56112482MaRDI QIDQ5519795
Publication date: 1966
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items
A neural network approach to tiling problems, Polyomino convolutions and tiling problems, Data analysis using a geometrical representation of predicate calculus, An undecidable problem about rational sets and contour words of polyominoes, The Y-hexomino has order 92, Polyominoes which tile rectangles, Optimal tristance anticodes in certain graphs, Covering by squares, Tetrolet shrinkage with anisotropic total variation minimization for image approximation, The PI index of polyomino chains, Tiling complexity of small n-ominoes \((N<10)\), Polyominoes on the infinite checkerboard, Symmetric edge-decompositions of hypercubes, \(q\)-Bessel, arbres, et chemins valués. (\(q\)-Bessel functions, trees, and weighted paths), Attribute grammars are useful for combinatorics, Packing problems, Enumeration of skew Ferrers diagrams and basic Bessel functions, On the cell-growth problem for arbitrary polygons, Derived tilings, A characterization of recognizable picture languages by tilings by finite sets, A linear algorithm to tile the trapezes with \(h_ m\) and \(v_ n\), Tiling figures of the plane with two bars, Algebraic languages and polyominoes enumeration, Tiling rectangles with polyominoes, Tiling rectangles and half strips with congruent polyominoes, Tiling with polyominoes and combinatorial group theory, Generating functions for column-convex polyominoes, Barring rectangles from the plane, Klarner systems and tiling boxes with polyominoes, Tiling the Plane with a Fixed Number of Polyominoes, A Partition Theory of Planar Animals, Etalements cristallographiques
