Sciweavers

ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
13 years 9 months ago
Deciding k-Colorability of P5-Free Graphs in Polynomial Time
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
Chính T. Hoàng, Marcin Kaminski, Vad...
ISAAC
2009
Springer
131views Algorithms» more  ISAAC 2009»
14 years 5 months ago
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-colo...
Daniel Bruce, Chính T. Hoàng, Joe Sa...