Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5890901)
From MaRDI portal
scientific article; zbMATH DE number 6639363
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning \(H\)-minor free graphs into three subgraphs with no large components |
scientific article; zbMATH DE number 6639363 |
Statements
Partitioning \(H\)-minor free graphs into three subgraphs with no large components (English)
0 references
14 October 2016
0 references
graph minors
0 references
coloring
0 references
partitioning
0 references
