Coloring Artemis graphs

Details Coloring Artemis graphs Coloring Artemis graphs

2005-04-18

arxiv.org/abs/cs/0504082v1

Computer Science

Discrete Mathematics

Scientific paper

We consider the class A of graphs that contain no odd hole, no antihole, and no ``prism'' (a graph consisting of two disjoint triangles with three disjoint paths between them). We show that the coloring algorithm found by the second and fourth author can be implemented in time O(n^2m) for any graph in A with n vertices and m edges, thereby improving on the complexity proposed in the original paper.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-137768