Sciweavers

Share
ALGORITHMICA
2010

Deciding k-Colorability of P5-Free Graphs in Polynomial Time

9 years 12 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 that for every fixed integer k, there exists a polynomial-time algorithm determining whether or not a P5-free graph admits a k-coloring, and finding one, if it does.
Chính T. Hoàng, Marcin Kaminski, Vad
Added 31 Jan 2011
Updated 31 Jan 2011
Type Journal
Year 2010
Where ALGORITHMICA
Authors Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
Comments (0)
books