On List Colouring and List Homomorphism of Permutation and Interval Graphs
Discrete Mathematics
2012-06-25 v1
Abstract
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 solving list colouring of permutation graphs with a bounded total number of colours. 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.
Keywords
Cite
@article{arxiv.1206.5106,
title = {On List Colouring and List Homomorphism of Permutation and Interval Graphs},
author = {Jessica Enright and Lorna Stewart and Gabor Tardos},
journal= {arXiv preprint arXiv:1206.5106},
year = {2012}
}