A still better performance guarantee for approximate graph coloring

Berger, 1990, A better performance guarantee for approximate graph coloring, Algorithmica, 5, 459, 10.1007/BF01840398 Boppana, 1992, Approximating maximum independent sets by excluding subgraphs, BIT, 32, 180, 10.1007/BF01994876 Halldórsson, 1992, Lower bounds for on-line graph coloring, Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, 211 Johnson, 1974, Worst case behaviour of graph coloring algorithms, Proc. 5th Southeastern Conf. on Combinatorics, Graph Theory, and Computing, Congr. Numer., X, 513 Lund, 1992, On the hardness of approximating minimization problems Wigderson, 1983, Improving the performance guarantee for approximate graph coloring, J. ACM, 30, 729, 10.1145/2157.2158