X. Shu

most citedDeciding k-colourability of

P_{5}

-free graphs in polynomial time

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DS2007★ 2 cited

Deciding k-colourability of $P_{5}$ -free graphs in polynomial time

Chính T. Hoàng, Marcin Kamiński, Vadim Lozin +2

The problem of computing the chromatic number of a $P_{5}$ -free graph is known to be NP-hard. In contrast to this negative result, we show that determining whether or not a $P_{5}$ -fre…

cs.DM2006

k-Colorability of P5-free graphs

C. T. Hoang, J. Sawada, X. Shu

A polynomial time algorithm that determines for a fixed integer k whether or not a P5-free graph can be k-colored is presented in this paper. If such a coloring exists, the algorit…

Deciding k-colourability of P5​-free graphs in polynomial time

k-Colorability of P5-free graphs

Deciding k-colourability of $P_{5}$ -free graphs in polynomial time