1 citations · 1 across the 1 of their papers we have counts for
1 paper
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…