Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5915769): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1503.08371 / rank | |||
Normal rank | |||
Revision as of 20:37, 18 April 2024
scientific article; zbMATH DE number 6813545
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
