Triangle-free -free graphs are 4-colorable

A graph is 2 P 3 -free if it does not contain two vertex-disjoint paths on three vertices as an induced subgraph. We prove that every triangle-free 2 P 3 -free graph is 4-colorable. This answers an open question posed by Broersma et al.