On the NP-completeness of the k-colorability problem for triangle-free graphs

We show that the question “Is a graph 3-colorable?” remains NP-complete when restricted to the class of triangle-free graphs with maximum degree 4. Likewise the question “Is a triangle-free graph k-colorable?” is shown to be NP-complete for any fixed value of k ⩾ 4.