Polynomial-time algorithm for vertex k-colorability of P_5-free graphs
  We give the first polynomial-time algorithm for coloring vertices of P_5-free graphs with k colors. This settles an open problem and generalizes several previously known results. 
Marcin Kaminski and Vadim Lozin