Optimal on-line coloring of circular arc graphs

Abstract

We show that a certain optimal on-line coloring algorithm for interval graphs given independently by Kierstead and Slusarek can be applied to a wider class of circular arc graphs. We prove that the competitive ratio of the algorithm is equal to 3 which improves a previous result by Marathe, Hunt and Ravi.