k-Colorability of P5-free graphs

Details k-Colorability of P5-free graphs k-Colorability of P5-free graphs

2006-09-14

arxiv.org/abs/cs/0609083v1

Computer Science

Discrete Mathematics

Scientific paper

A polynomial time algorithm that determines for a fixed integer k whether or
not a P5-free graph can be k-colored is presented in this paper. If such a
coloring exists, the algorithm will produce a valid k-coloring.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-410713