Triangle‐free graphs that do not contain an induced subdivision of K4 are 3‐colorable
- Additional Document Info
- View All
© 2018 Wiley Periodicals, Inc. 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].
author list (cited authors)
Chudnovsky, M., Liu, C., Schaudt, O., Spirkl, S., Trotignon, N., & Vušković, K.