A Note on Circular Arc Online Coloring using First Fit
Data Structures and Algorithms
2013-12-05 v2 Discrete Mathematics
Combinatorics
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 colors, where is the size of the maximum clique of . Since the column construction can not be adapted to circular arc graphs we give a different proof to establish an upper bound of for online coloring a circular arc graph with the First Fit algorithm.
Cite
@article{arxiv.1211.0297,
title = {A Note on Circular Arc Online Coloring using First Fit},
author = {Paraskevas V. Lekeas},
journal= {arXiv preprint arXiv:1211.0297},
year = {2013}
}
Comments
9 pages, 3 figures, Figure 3 corrected from previous version