Chudnovsky, MariaLiu, Chun-HungSchaudt, OliverSpirkl, SophieTrotignon, NicolasVušković, Kristina2022-08-122022-08-122019-10https://doi.org/10.1002/jgt.22441http://hdl.handle.net/10012/18529This is the peer reviewed version of the following article: Chudnovsky, M., Liu, C.-H., Schaudt, O., Spirkl, S., Trotignon, N., & Vušković, K. (2019). Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. Journal of Graph Theory, 92(2), 67–95. https://doi.org/10.1002/jgt.22441, which has been published in final form at https://doi.org/10.1002/jgt.22441. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions.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ć.enAttribution-NonCommercial-NoDerivatives 4.0 Internationalinduced subdivisiontriangle-free graphsTriangle-free graphs that do not contain an induced subdivision of K4 are 3-colorableArticle