Coloring Graphs with Sparse Neighborhoods

Journal of Combinatorial Theory. Series B

Volumn 77, Issue 1, 1999, Pages 73-82

  Alon, Noga ^a,b   Krivelevich, Michael ^b   Sudakov, Benny ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003151866     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1999.1910     Document Type: Article

References (14)

1. Ajtai M., Komlós J., Szemerédi E. A dense infinite Sidon sequence. European J. Combin. 2:1981;1-11.
2. Alon N. The strong chromatic number of a graph. Random Structures Algorithms. 3:1992;1-7.
3. N. Alon, M. Krivelevich, and, B. Sudakov, List coloring of random and pseudo-random graphs, Combinatorica, to appear.
4. Alon N., Spencer J. The Probabilistic Method. 1992;Wiley, New York.
5. Brooks R. L. On coloring the nodes of a network. Math. Proc. Cambridge Philos. Soc. 37:1941;194-197.
6. Bollobás B. Chromatic number, girth and maximal degree. Discrete Math. 24:1978;311-314.
7. A. R. Johansson, Asymptotic choice number for triangle free graphs, to appear.
8. A. R. Johansson, The choice number of sparse graphs, manuscript, 1998.
9. Jensen T., Toft B. Graph Coloring Problems. 1995;Wiley, New York.
10. Kostochka A. V., Mazurova N. P. An inequality in the theory of graph coloring. Metody Diskret. Anal. 30:1977;23-29.
11. Lovász L. Combinatorial Problems and Exercises. 1993;North-Holland, Amsterdam.
12. McDiarmid C. J. H. On the method of bounded differences. Siemons J. Surveys in Combinatorics 1989. London Math. Soc. Lecture Notes Series. 141:1989;148-188 Cambridge Univ. Press, Cambridge.
13. Molloy M., Reed B. A bound on the strong chromatic index of a graph. J. Combin. Theory Ser. B. 69:1997;103-109.
14. Vizing V. G. On a estimate on the chromatic class of a p-graph. Diskret. Anal. 3:1964;25-30.