On Brooks’ Theorem for Sparse Graphs

Combinatorics, Probability and Computing

Volumn 4, Issue 2, 1995, Pages 97-132

  Kim, Jeong Han ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84974326282     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548300001528     Document Type: Article

References (30)

1. Ajtai M., Komlós J. and Szemerédi E. (1980) A note on Ramsey numbers. J. Combinatorial Th. (A) 29 354–360.
2. Ajtai M., Komlós J. and Szemerédi E. (1981) A dense infinite Sidon sequence. European J. Combin. 2 1–15.
3. Alon N., Restricted coloring of graphs. Proc. 14th British Combinatorial Conf. to appear.
4. Bollobás B. (1978) Chromatic number, girth and maximal degree. Discrete Math. 24 311–314.
5. Borodin O. and Kostochka A. (1977) On an upper bound of a graph'h chromatic number depending on the graph'h degree and density. J. Combin. Theory Ser. B 23 247–250.
6. Breiman L. (1968) Probability, Addison-Wesley.
7. Brooks R. L. (1941) On colouring the nodes of a network. Proc. Cambridge Philos. Soc. 37 194–197.
8. Catlin P. (1978) A bound on the chromatic number of a graph. Discrete Math. 22 81–83.
9. Erdős P. and Lovász L. (1974) Problems and results on 3-chromatic hypergraphs and some related questions. Colloq. Math. Soc. Janos Bolyai 10 609–627.
10. Erdős P., Rubin A. L. and Taylor H. (1979) Choosability in graphs. Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium 26 125–157.
11. Frankl P. and Rödl V. (1985) Near-perfect coverings in graphs and hypergraphs. Europ. J. Combinatorics 6 317–326.
12. Füredi Z. (1988) Matchings and Covers in Hypergraphs. Graphs and Combinatorics 4 115–206.
13. Kahn J. (1991) Recent results on some not-so-recent hypergraph matching and covering problems. Proc. 1st Int't Conference on Extremal Problems for Finite Sets, Visegrád, June to appear.
14. Kahn J. (1993) Asymptotically good list colorings. J. Combinatorial Theory, Series A. (submitted)
15. Kahn J. and Szemerédi E. (1988) The second eigenvalue of a random regular graph, manuscript, (appeared as first chapter in: Friedman J., Kahn J. and Szemerédi E., On the second eigenvalue of a random regular graph, Proc. 21st STOC, ACM, 1989).
16. Komlós J., Pintz J. and Szemerédi E. (1982) On Heilbronn'n triangle problem. J. London Math. Soc. 25 13–24.
17. Kostochka A. Letter to B. Toft.
18. Lawrence J. (1978) Covering the vertex set of a graph with subgraphs of smaller degree. Discrete Math. 21 61–68.
19. Milman V. and Schechtman G. (1980) Asymptotic Theory of Finite Dimensional Normed Spaces, Springer.
20. N. Pippenger, unpublished.
21. Pippenger N. and Spencer J. (1989) Asymptotic behavior of the chromatic index for hyper-graphs. J. Combinatorial Th. (A) 51 24–42.
22. Rödl V. (1985) On a packing and covering problem. Europ. J. Combinatorics 5 69–78.
23. Shamir E. and Spencer J. (1987) Sharp concentration of the chromatic number on random graphs Gn.p. Combinatorica 7 121–129.
24. Shearer J. (1983) A note on the independence number of triangle-free graphs. Discrete Math. 46 83–87.
25. Shearer J. (1991) A note on the independence number of triangle-free graphs, II. J. Combin. Theory Ser. B 53 300–307.
26. Spencer J. (1977) Asymptotic lower bounds for Ramsey functions. Discrete Math. 20 69–76.
27. Spencer J. (1987) Ten Lectures on the Probabilistic Method, Society for Industrial and Applied Mathematics.
28. Turán P. (1941) Egy gráfelméleti szélsőértékfeladatról. Mat. Fiz. Lapok 48 436–452; see also: On the theory pf graphs, Colloq. Math. 3 (1954) 19–30.
29. Vizing V. G. (1968) Some unsolved problems in graph theory (Russian). Uspehi Mat. Nauk. 23 117–134. English Translation in Russian Math. Surveys 23 125–141.
30. Vizing V. G. (1967) Coloring the vertices of a graph in prescribed colors (Russian). Diskret. Analiz. No. 29, Metody Diskret. Anal. v. Teorii Kodov i Shem 101 3–10.