Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5890901)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6639363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9852445721626282
0 references
0.805833637714386
0 references
0.784375786781311
0 references
0.7837623953819275
0 references
