Online coloring graphs with high girth and high oddgirth
Combinatorics
2009-07-21 v1
Abstract
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.
Keywords
Cite
@article{arxiv.0907.3420,
title = {Online coloring graphs with high girth and high oddgirth},
author = {Judit Nagy-Gyorgy},
journal= {arXiv preprint arXiv:0907.3420},
year = {2009}
}