On List Coloring and List Homomorphism of Permutation and Interval Graphs
Jessica A. Enright, Lorna K. Stewart, Gábor Tardos · SIAM Journal on Discrete Mathematics · 2014
List coloring is an NP-complete decision problem even if the total number of colors is three. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving list coloring of permutation graphs with a bounded total number of colors. More generally, we give a polynomial-time algorithm that solves the list-homomorphism problem to any fixed target graph for a large class of input graphs, including all permutation and interval graphs.