A linear algorithm for a perfect matching in polyomino graphs
From MaRDI portal
Publication:528497
DOI10.1016/J.TCS.2017.02.028zbMath1369.05193OpenAlexW2594466861MaRDI QIDQ528497
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
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
This page was built for publication: A linear algorithm for a perfect matching in polyomino graphs