1. Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM J. Comput. 26, 1733–1748 (1997)
2. Alon, N., Krivelevich, M.: The concentration of the chromatic number of random graphs. Combinatorica 17, 303–313
3. Charikar, M.: On semidefinite programming relaxations for graph coloring and vertex cover. In: Proc. 13th SODA, pp. 616–620 (2002)
4. Coja-Oghlan, A., Taraz, A.: Exact and approximative algorithms for colouring G(n, p) (preprint), available from http://www.informatik.hu-berlin.de/~coja/;
5. A preliminary version has appeard in Proc. 20th STACS (2003), pp. 487–498 (2003)