%0 Journal Article
%T A certifying algorithm for 3-colorability of P5-free graphs
%A Daniel Bruce
%A Chinh T. Hoang
%A Joe Sawada
%J Computer Science
%D 2009
%I arXiv
%X We provide a certifying algorithm for the problem of deciding whether a P5- free graph is 3-colorable by showing there are exactly six finite graphs that are P5-free and not 3-colorable and minimal with respect to this property.
%U http://arxiv.org/abs/0907.3497v1