Online coloring graphs with high girth and high oddgirth
classification
🧮 math.CO
keywords
graphshighgirthoddgirthonlinealgorithmboundchromatic
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.