Triangle-free graphs that do not contain an induced subdivision of K₄ are 3-colorable

Triangle-free graphs that do not contain an induced subdivision of K₄ are 3-colorable

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].

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Chudnovsky, M, Liu, C-H, Schaudt, O, Spirkl, S, Trotignon, N, Vušković, K
Format: Artikel
Sprache:eng
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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].
DOI:10.1002/jgt.22441