Graphs that contain a K_{1,2,3} and no induced subdivision of K₄ are 4-colorable

Abstract: In 2012, L'ev^eque, Maffray, and Trotignon conjectured that each graph

G

that contains no induced subdivision of

K_{4}

is

4

-colorable. In this paper, we prove that this conjecture holds when

G

contains a

K_{1, 2, 3}

.

This page was built for publication: Graphs that contain a $K_{1,2,3}$ and no induced subdivision of $K_4$ are $4$-colorable