published by Jessica Enright
in 2011
in Informatics Engineering
and research's language is
English
Download
Abstract in English
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 graphs.