The Zero-Free Intervals for Chromatic Polynomials of Graphs

Combinatorics Probability and Computing

Volumn 6, Issue 4, 1997, Pages 497-506

  Thomassen, Carsten ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031497630     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548397003131     Document Type: Article

References (18)

1. Beraha, S. and Kahane, J. (1979) Is the four-color conjecture almost false? J. Combin. Theory Ser. B 27 1-12.
2. Biggs, N. L., Damerell, R. M. and Sands, D. A. (1972) Recursive families of graphs. J. Combin. Theory Ser. B 12 123-131.
3. Birkhoff, G. D. and Lewis, D. C. (1946) Chromatic polynomials. Trans. Amer. Math. Soc. 60 355-451.
4. Brenti, F., Royle, G. F. and Wagner, D. G. (1994) Location of zeros of chromatic and related polynomials of graphs. Can. J. Math. 46 55-80.
5. Diestel, R. (1990) Graph decompositions. Clarendon Press, Oxford.
6. Jackson, B. (1993) A zero-free interval for chromatic polynomials of graphs. Combinatorics, Probability and Computing 2 325-336.
7. Jensen, T. and Toft, B. (1995) Graph Coloring Problems. Wiley, New York.
8. Kostochka, A. (1982) A lower bound for the Hadwiger number of a graph as a function of the average degree of its vertices. Discret. Analyz. Novosibirsk 38 37-58.
9. Mader, W. (1967) Homomorphieeigenschaften und mittlere Kantendichte von Graphen. Math. Ann. 174 265-268.
10. Read, R. C. and Royle, G. F. (1991) Chromatic roots of families of graphs. In Graph Theory, Combinatorics, and Applications (Alavi, Chartrand, Oellermann and Schwenk, eds), Wiley, New York, pp. 1009-1029.
11. Read, R. C. and Tutte, W. T. (1988) Chromatic polynomials. In Selected Topics in Graph Theory, volume 3 (L. W. Beineke and R. J. Wilson, eds), Academic Press, pp. 15-42.
12. Thomason, A. (1984) An extremal function for complete subgraphs. Math. Proc. Camb. Phil. Soc. 95 261-265.
13. Thomassen, C. (1991) Tilings of the torus and the Klein bottle and vertex-transitive graphs on a fixed surface. Trans. Amer. Math. Soc. 323 605-635.
14. Wagner, K. (1937) Über eine Eigenschaft der ebenen Komplexe. Math. Ann. 114 570-590.
15. Wagner, K. (1937) Über eine Erweiterung eines Satzes von Kuratowski. Deutsche Math. 2 280-285.
16. Woodall, D. R. (1977) Zeros of chromatic polynomials. In Combinatorial Surveys, Proc. Sixth British Combinatorial Conference (P. Cameron, ed.), Academic Press, London, pp. 199-223.
17. Woodall, D. R. (1992) A zero-free interval for chromatic polynomials. Discrete Math. 101 333-341.
18. Woodall, D. R. The largest zero of the chromatic polynomial. Discrete Math., to appear.