Combinatorial properties of polyominoes
From MaRDI portal
Publication:1167188
DOI10.1007/BF02579327zbMath0491.05048MaRDI QIDQ1167188
Publication date: 1981
Published in: Combinatorica (Search for Journal in Brave)
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Polyominoes (05B50)
Related Items (26)
A maximum resonant set of polyomino graphs ⋮ A minimax result for perfect matchings of a polyomino graph ⋮ Perfect matchings in random polyomino chain graphs ⋮ Irregular polyomino tiling via integer programming with application in phased array antenna design ⋮ Algebraic languages and polyominoes enumeration ⋮ Elementary components of essentially disconnected polyomino graphs ⋮ Perfect matchings of polyomino graphs ⋮ Generating convex polyominoes at random ⋮ On maximal resonance of polyomino graphs ⋮ The number of Kekulé structures of polyominos on the torus ⋮ Intersection graphs of maximal sub-polygons of \(k\)-lizards ⋮ A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs ⋮ The structure character of essentially disconnected polyomino graphs ⋮ The atom-bond connectivity index of catacondensed polyomino graphs ⋮ On \(k\)-resonance of grid graphs on the plane, torus and cylinder ⋮ A note on the contractions for orthogonal polygons ⋮ A characterization of intersection graphs of the maximal rectangles of a polyomino ⋮ Regular generalized polyomino graphs ⋮ Perfect matchings of generalized polyomino graphs ⋮ Enumeration of Wiener indices in random polygonal chains ⋮ The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes ⋮ A polyomino with no stochastic function ⋮ Maximal superpositions of horizontally convex polyominoes ⋮ A Class of Perfect Graphs ⋮ Hypergraph families with bounded edge cover or transversal number ⋮ Polyominos and perfect graphs
Cites Work
This page was built for publication: Combinatorial properties of polyominoes
