English

3-List Colouring Permutation Graphs

Discrete Mathematics 2015-03-19 v2

Abstract

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.

Keywords

Cite

@article{arxiv.1104.5009,
  title  = {3-List Colouring Permutation Graphs},
  author = {Jessica Enright and Lorna Stewart},
  journal= {arXiv preprint arXiv:1104.5009},
  year   = {2015}
}
R2 v1 2026-06-21T17:59:00.380Z