A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs (Q424181)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs |
scientific article; zbMATH DE number 6040021
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs |
scientific article; zbMATH DE number 6040021 |
Statements
A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs (English)
0 references
31 May 2012
0 references
perfect matching
0 references
essentially disconnected
0 references
lower bound
0 references
0 references
0 references
0.8904907
0 references
0.8749276
0 references
0.8557397
0 references
0.85546106
0 references
0.85394174
0 references
0.85351014
0 references
0.8524332
0 references
0.8514345
0 references
