@article{d31c287e586747efa77b3d5d0b664dd7,
title = "Coloring interval graphs with first-fit",
abstract = "Improved bounds on the performance of the on-line graph coloring algorithm First-Fit on interval graphs are obtained.",
author = "Henry Kierstead and Jun Qin",
note = "Funding Information: For a graph G let co(G), a(G), and z(G) denote the clique number of G, the independence number of G, and the chromatic number of G, respectively. The neighborhood of a vertex v e F is N(v) = {x ~ F: v ~ x}. The First-Fit chromatic * Corresponding author. Research partially supported by Office of Naval Research grant N00014-90-J-1206.",
year = "1995",
month = sep,
day = "8",
doi = "10.1016/0012-365X(94)00285-Q",
language = "English (US)",
volume = "144",
pages = "47--57",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",
}