The interval constrained 3-coloring problem

Details The interval constrained 3-coloring problem The interval constrained 3-coloring problem

2009-07-21

arxiv.org/abs/0907.3563v2

Computer Science

Discrete Mathematics

minor revision

Scientific paper

In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if the number of different colors is 3. Previously, it has only been known that it is NP-complete, if the number of colors is part of the input and that the problem is solvable in polynomial time, if the number of colors is at most 2. We also show that it is hard to satisfy almost all of the constraints for a feasible instance.

Affiliated with

Also associated with

No associations

Rating

The interval constrained 3-coloring problem 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 The interval constrained 3-coloring problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The interval constrained 3-coloring problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-175242