118 citations · 187 across the 14 of their papers we have counts for
1 paper · 1 filter
Jessica Enright, Lorna Stewart
3-list colouring is an NP-complete decision problem. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving 3-list colouring on permutation gra…