A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs (Q424181): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10910-011-9900-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075546798 / rank | |||
Normal rank | |||
Revision as of 00:09, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs |
scientific article |
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
