A linear algorithm for a perfect matching in polyomino graphs

DOI10.1016/J.TCS.2017.02.028zbMath1369.05193OpenAlexW2594466861MaRDI QIDQ528497

Yu-qing Lin, Fu Ji Zhang

Publication date: 12 May 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.02.028

zbMATH Keywords

perfect matchinglinear algorithmpolyomino graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Polyominoes (05B50)

Related Items (2)

On degree-based topological indices of random polyomino chains ⋮ Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids

Cites Work

• A linear algorithm for perfect matching in hexagonal systems
• Perfect matchings of polyomino graphs
• The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes
• A theorem concerning perfect matchings in hexagonal systems
• Perfect matchings in hexagonal systems

This page was built for publication: A linear algorithm for a perfect matching in polyomino graphs