Triangle‐free graphs that do not contain an induced subdivision of K 4 are 3‐colorable
Résumé
We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivision of K 4 are 3-colorable. This proves a conjecture of Trotignon and Vušković [5].
Domaines
Mathématique discrète [cs.DM]Origine | Fichiers produits par l'(les) auteur(s) |
---|