k-Colorability of P5-free graphs
Chı́nh T. Hoàng, Joe Sawada, Xiao Shu · arXiv (Cornell University) · 2006
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.