Triangle‐free graphs that do not contain an induced subdivision of <i>K</i><sub>4</sub> are 3‐colorable (Q5241606)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Triangle‐free graphs that do not contain an induced subdivision of K4 are 3‐colorable |
scientific article; zbMATH DE number 7125219
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Triangle‐free graphs that do not contain an induced subdivision of <i>K</i><sub>4</sub> are 3‐colorable |
scientific article; zbMATH DE number 7125219 |
Statements
Triangle‐free graphs that do not contain an induced subdivision of <i>K</i><sub>4</sub> are 3‐colorable (English)
0 references
31 October 2019
0 references
coloring
0 references
induced subgraph
0 references
