A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs (Q424181): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 92E10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C90 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6040021 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
perfect matching | |||
| Property / zbMATH Keywords: perfect matching / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
essentially disconnected | |||
| Property / zbMATH Keywords: essentially disconnected / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
lower bound | |||
| Property / zbMATH Keywords: lower bound / rank | |||
Normal rank | |||
Revision as of 21:22, 29 June 2023
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
