Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5915769)
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 6813545
| 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 6813545 |
Statements
Partitioning \(H\)-minor free graphs into three subgraphs with no large components (English)
0 references
28 November 2017
0 references
vertex partitions
0 references
graph minors
0 references
odd minors
0 references
small components
0 references
0.9852445721626282
0 references
0.8043487668037415
0 references
0.8043487668037415
0 references
0.7961187362670898
0 references
0.7956817746162415
0 references
