Polynomial-time algorithm for vertex k-colorability of P_5-free graphs

Details Polynomial-time algorithm for vertex k-colorability of P_5-free graphs Polynomial-time algorithm for vertex k-colorability of P_5-free graphs

2006-07-26

arxiv.org/abs/cs/0607115v1

Computer Science

Discrete Mathematics

Scientific paper

We give the first polynomial-time algorithm for coloring vertices of P_5-free
graphs with k colors. This settles an open problem and generalizes several
previously known results.

Affiliated with

Also associated with

No associations

Rating

Polynomial-time algorithm for vertex k-colorability of P_5-free 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 Polynomial-time algorithm for vertex k-colorability of P_5-free graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial-time algorithm for vertex k-colorability of P_5-free graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-477540