71 citations · 230 across the 50 of their papers we have counts for
1 paper · 1 filter
Ken-ichi Kawarabayashi, Mikkel Thorup
We consider the problem of coloring a 3-colorable graph in polynomial time using as few colors as possible. We present a combinatorial algorithm getting down to $\tO(n^{4/11})$ col…