Online coloring graphs with high girth and high odd girth

Authors:
J. Nagy-GyöRgy
Affiliations:
Department of Mathematics, University of Szeged, Aradi Vértanúk tere 1, H-6720 Szeged, Hungary
Venue:
Operations Research Letters
Year:
2010

Citing 4
Cited 0

An on-line graph coloring algorithm with sublinear performance ratio

Discrete Mathematics
Coloring graphs without short non-bounding cycles

Journal of Combinatorial Theory Series B
Coloring Graphs On-line

Developments from a June 1996 seminar on Online algorithms: the state of the art
The chromatic number of a graph of girth 5 on a fixed surface

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an upper bound for the online chromatic number of graphs with high girth and for graphs with high odd girth generalizing Kierstead's algorithm for graphs that contain neither a C"3 or C"5 as an induced subgraph.