Abstract
We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivision of K4 are 3-colorable. This proves a conjecture of Trotignon and Vušković [J. Graph Theory. 84 (2017), no. 3, pp. 233–248].
Original language | English (US) |
---|---|
Pages (from-to) | 67-95 |
Number of pages | 29 |
Journal | Journal of Graph Theory |
Volume | 92 |
Issue number | 2 |
DOIs | |
State | Published - Oct 2019 |
All Science Journal Classification (ASJC) codes
- Geometry and Topology
- Discrete Mathematics and Combinatorics
Keywords
- coloring
- induced subgraph