Two complexity results for the vertex coloring problem

We show that the chromatic number of {P5,Kp−e}-free graphs can be computed in polynomial time for each fixed p. Additionally, we prove polynomial-time solvability of the weighted vertex coloring problem for {P5,P3+P2¯}-free graphs.