Online coloring graphs with high girth and high oddgirth [article]

Judit Nagy-Gyorgy
2009 arXiv   pre-print
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.
arXiv:0907.3420v1 fatcat:akc2blw5pfamzcywfqjfi63zy4