Perfect matchings of generalized polyomino graphs

DOI10.1007/S00373-005-0624-1zbMath1089.05061OpenAlexW2063886867MaRDI QIDQ2494107

Chenrong Si

Publication date: 16 June 2006

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-005-0624-1

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Polyominoes (05B50)

Related Items (8)

A minimax result for perfect matchings of a polyomino graph ⋮ Perfect matchings in random polyomino chain graphs ⋮ On maximal resonance of polyomino graphs ⋮ A heuristic approach to domino grid problem ⋮ A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs ⋮ The atom-bond connectivity index of catacondensed polyomino graphs ⋮ Regular generalized polyomino graphs ⋮ Enumeration of Wiener indices in random polygonal chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• Combinatorial properties of polyominoes
• Matching theory -- a sampler: From Dénes König to the present
• Perfect matchings of polyomino graphs
• The statistics of dimers on a lattice
• Perfect matchings in hexagonal systems

This page was built for publication: Perfect matchings of generalized polyomino graphs