A certifying algorithm for 3-colorability of P5-free graphs

Details A certifying algorithm for 3-colorability of P5-free graphs A certifying algorithm for 3-colorability of P5-free graphs

2009-07-20

arxiv.org/abs/0907.3497v1

Computer Science

Discrete Mathematics

Scientific paper

We provide a certifying algorithm for the problem of deciding whether a P5-
free graph is 3-colorable by showing there are exactly six finite graphs that
are P5-free and not 3-colorable and minimal with respect to this property.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-174548