3-List Colouring Permutation Graphs
classification
💻 cs.DM
keywords
colouringgraphslistpermutationalgorithmbipartitedecisioneven
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.