A Certifying Algorithm for 3-Colorability of P5-Free Graphs

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.

• Type: Conference
• Year: 2009
• Where: ISAAC
• Authors: Daniel Bruce, Chính T. Hoàng, Joe Sawada
• Keywords: Algorithm, Algorithms, ISAAC 2009, P5-free Graph