Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5915769): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jctb.2017.08.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCTB.2017.08.003 / rank | |||
Normal rank | |||
Latest revision as of 03:07, 11 December 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
