1 research outputs found
3-List Colouring Permutation Graphs
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
1 research outputs found