Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable
Loading...
Date
2019-10
Authors
Chudnovsky, Maria
Liu, Chun-Hung
Schaudt, Oliver
Spirkl, Sophie
Trotignon, Nicolas
Vušković, Kristina
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Wiley
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ć.
Description
This 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.
Keywords
induced subdivision, triangle-free graphs