most citedDeciding k-colourability of -free graphs in polynomial time

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

collaborators
Showing cs.DMShow all

1 paper · 1 filter

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…