  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.
