3-List Colouring Permutation Graphs
Jessica Enright, Lorna Stewart
TL;DR
This paper presents a polynomial-time algorithm for solving the 3-list colouring problem specifically on permutation graphs, addressing a known NP-complete problem in a specialized graph class.
Contribution
The paper introduces the first polynomial-time solution for 3-list colouring on permutation graphs, a problem previously known to be NP-complete in general.
Findings
Polynomial-time algorithm for 3-list colouring on permutation graphs
Addresses NP-completeness in a specific graph class
Advances understanding of graph colouring complexity
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Graph Labeling and Dimension Problems