k-Colorability of P5-free graphs
  A polynomial time algorithm that determines for a fixed integer k whether or not a P5-free graph can be k-colored is presented in this paper. If such a coloring exists, the algorithm will produce a valid k-coloring. 
C. T. Hoang, J. Sawada, X. Shu