Publication: A certifying algorithm for 3-colorability of P5-free graphs

All || By Area || By Year

Title	A certifying algorithm for 3-colorability of P5-free graphs
Authors/Editors*	D. Bruce, C. Hoang, and J. Sawada
Where published*	The 20th International Symposium on Algorithms and Computation (ISAAC 2009)
How published*	Proceedings
Year*	2009
Volume
Number
Pages
Publisher
Keywords
Link
Abstract	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.