970 citations · 1.7k across the 49 of their papers we have counts for
Showing 2012 · cs.DMShow all
2 papers · 2 filters
cs.DM2012★ 1 cited
Edge-colouring seven-regular planar graphs
Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi +1
A conjecture due to the fourth author states that every -regular planar multigraph can be -edge-coloured, provided that for every odd set of vertices, there are at least…
cs.DM2012★ 5 cited
Combinatorial coloring of 3-colorable graphs
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…