%0 Journal Article
%T k-Colorability of P5-free graphs
%A C. T. Hoang
%A J. Sawada
%A X. Shu
%J Computer Science
%D 2006
%I arXiv
%X 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.
%U http://arxiv.org/abs/cs/0609083v1