Online coloring graphs with high girth and high oddgirth

Details Online coloring graphs with high girth and high oddgirth Online coloring graphs with high girth and high oddgirth

2009-07-20

arxiv.org/abs/0907.3420v1

Mathematics

Combinatorics

Scientific paper

We give an upper bound for the online chromatic number of graphs with high
girth and for graphs with high oddgirth generalizing Kier- stead's algorithm
for graphs that contain neither a C3 or C5 as an induced subgraph.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-696559