A linear algorithm for a perfect matching in polyomino graphs
From MaRDI portal
Publication:528497
DOI10.1016/j.tcs.2017.02.028zbMath1369.05193MaRDI 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
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05B50: Polyominoes
Related Items
Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids, On degree-based topological indices of random polyomino chains
Cites Work