A Note on First-Fit Coloring of Interval Graphs

Chrobak, M., Ślusarek, M.: On some packing problems related to dynamic storage allocation. RAIRO Inform. Theor. Appl. 22, 487–499 (1988)

Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic, London (1980)

Kierstead, H.A., Qin, J.: Coloring interval graphs with first-fit. Discrete Math. 144, 47–57 (1995)

Kierstead, H.A.: The linearity of first-fit coloring of interval graphs. SIAM J. Discrete Math. 1(4), 526–530 (1988)

Varadarajan, K., Pemmaraju, S.V., Raman, R.: Buffer minimization using max-coloring. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium On Discrete Algorithms, pp. 562–571, New Orleans, 11–14 January 2004