3-List Colouring Permutation Graphs

Details 3-List Colouring Permutation Graphs 3-List Colouring Permutation Graphs

2011-04-26

arxiv.org/abs/1104.5009v2

Computer Science

Discrete Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

3-List Colouring Permutation Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with 3-List Colouring Permutation Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 3-List Colouring Permutation Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-297180