Excluding any graph as a minor allows a low tree-width 2-coloring (Q1826951)
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 2082029
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Excluding any graph as a minor allows a low tree-width 2-coloring |
scientific article; zbMATH DE number 2082029 |
Statements
Excluding any graph as a minor allows a low tree-width 2-coloring (English)
0 references
6 August 2004
0 references
Tree-width
0 references
Vertex partitions
0 references
Edge partitions
0 references
Small components
0 references
0.7984708547592163
0 references
0.7966384291648865
0 references
0.7916339039802551
0 references
0.7872239351272583
0 references
0.78690105676651
0 references
