118 citations · 187 across the 14 of their papers we have counts for
1 paper · 1 filter
Jessica Enright, Lorna Stewart, Gabor Tardos
List colouring is an NP-complete decision problem even if the total number of colours is three. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for…