Perfect matchings of polyomino graphs (Q1376069): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:14, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect matchings of polyomino graphs |
scientific article |
Statements
Perfect matchings of polyomino graphs (English)
0 references
14 September 1998
0 references
A characterization of polyominoes having a perfect matching resp. being elementary is given. This allows to give a special decomposition of non-elementary polyominoes with perfect matchings into elementary subpolyominoes such that the number of perfect matchings of the original graph is the product of those of the latter graphs.
0 references
polyominoes
0 references
perfect matching
0 references
