ω, Δ, and χ

Journal of Graph Theory

Volumn 27, Issue 4, 1998, Pages 177-212

  Reed, B ^a  

^a CNRS   (France)

Author keywords

Graph coloring; Probabilistic method

Indexed keywords

EID: 0346544711     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199804)27:4<177::AID-JGT1>3.0.CO;2-K     Document Type: Article

References (22)

1. N. Alon and J. Spencer, The probabilistic method; Wiley, New York (1992).
2. K. Azuma, Weighted sums of certain dependent variables, Tohoku Math Journal 3 (1967), 357-367.
3. M. Behzad, Graphs and their chromatic numbers; Ph.D. thesis, Michigan State University (1965).
4. C. Berge, Sur le couplage maximum d'un graph, C. R. Acad. Sciences Paris 247 (1958), 258-259.
5. C. Berge and V. Chvatal (Eds.), Topics in perfect graphs, North Holland, Amsterdam (1984).
6. B. Bollobas, Random graphs; Academic Press (1985).
7. J. A. Bondy and U. S. R. Murty, Graph theory with applications, North Holland, New York (1976).
8. R. Brooks, On coloring the nodes of a network, Proc. of the Cambridge Phil. Soc. 37 (1941), 194-197.
9. 2-free graphs of bounded degree, Discrete Math 81 (1990), 129-135.
10. J. Edmonds, Paths, trees, and flowers, Canadian Journal of Mathematics 17 (1965), 449-467.
11. P. Erdös and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, in Infinite sets and finite sets, North-Holland, Amsterdam (1975), 609-628.
12. W. Feller, An introduction to probability theory and its applications, Vol. 1; Wiley, New York (1966).
13. T. Jensen and B. Toft, Graph coloring problems, Wiley, New York (1995).
14. Johanssen, unpublished. See [13].
15. R. Karp, Reducibility amongst combinatorial problems, in Complexity of Computer Computations, Plenum, New York (1972), 85-103.
16. J. Kim, On Brooks' theorem for sparse graphs, Combinatorics, Probability, and Computing 4 (1995), 97-122.
17. A. Kostochka, Degree, girth and chromatic number, Combinatorics, Vol. 18 of Colloquia Mathematica Societatis Janos Bolyai; North Holland (1978), 679-696.
18. A. Kostochka and N. Mazurova, An inequality in the theory of graph coloring (in Russian), Metody Diskret. Analiz. 30 (1977), 23-29.
19. M. Molloy and B. Reed, A bound on the strong chromatic index of a graph, submitted, 1995.
20. M. Molloy and B. Reed, Total coloring with Δ + c colors, submitted.
21. O. Ore, The four-colored problem; Academic Press, New York, (1967).
22. V. Vizing, Some unsolved problems in graph theory, Russian Math Surveys 23 (1968), 125-141.