On-Line Coloring of Sparse Random Graphs and Random Trees

Journal of Algorithms

Volumn 23, Issue 1, 1997, Pages 195-205

  Pittel, Boris ^a   Weishaar, Robert S ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010547147     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0827     Document Type: Article

References (11)

1. B. Bollobás, "Random Graphs," Academic Press, San Diego, 1985.
2. B. Bollobás, The chromatic number of random graphs, Combinatorica 8 (1988), 49-55.
3. G. Grimmet and C. McDiarmid, On coloring random graphs, Math. Proc. Cambridge Philos. Soc. 77 (1975), 313-324.
4. A. Gyárfás and J. Lehel, On-line and first fit colorings of graphs, J. Graph Theory 12 (1988), 217-227.
5. S. Irani, Coloring inductive graphs on-line, Algorithmica 11 (1994), 53-72.
6. T. Łuczak, A note on the sharp concentration of the chromatic number of random graphs, Combinatorica 11 (1991), 295-297.
7. J. W. Moon, "Counting Labelled Trees," Canadian Mathematical Monographs, 1970.
8. R. Motwani and P. Raghavan, "Randomized Algorithms," Cambridge Univ. Press, Cambridge, UK, 1995.
9. B. Pittel, On the probable behavior of some algorithms for finding the stability number of a graph, Math. Proc. Cambridge Philos. Soc. 92 (1982), 511-526.
10. n, p, Combinatorica 7 (1987), 124-129.
11. E. Shamir and E. Upfal, Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces, J. Algorithms 5 (1984), 488-501.