A Note on Circular Arc Online Coloring using First Fit
Abstract
In Raman (2007), using a column construction technique it is proved that every interval graph can be colored online with First Fit with at most 8w(G) colors, where w(G) is the size of the maximum clique of G. Since the column construction can not be adapted to circular arc graphs we give a different proof to establish an upper bound of 9w(G) for online coloring a circular arc graph G with the First Fit algorithm.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.