Zeros of chromatic and flow polynomials of graphs

Journal of Geometry

Volumn 76, Issue 1-2, 2003, Pages 95-109

  Jackson, Bill ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33744922070     PISSN: 00472468     EISSN: 14208997     Source Type: Journal    
DOI: 10.1007/s00022-003-1694-y     Document Type: Article

References (46)

1. Appel, K. and Haken, W., Every planar map is 4-colourable. Part I: Discharging, Illinois J. Math. 21 (1977), 429-490.
2. Appel, K., Haken, W. and Koch, J., Every planar map is 4-colourable. Part II: Reducibility, Illinois J. Math. 21 (1977), 491-567.
3. S. Beraha, Infinite non-trivial families of maps and chromials, thesis, John Hopkins University, 1975.
4. Beraha, S., Kahane, J., Is the four-color conjecture almost false? J. Combinatorial Theory Ser. B 27 (1979), 1-12.
5. Beraha, S., Kahane, J. and Weiss, N. J., Limits of chromatic zeros of some families of maps, J. Combinatorial Theory Ser. B 28 (1980), 52-65.
6. Biggs, N. L., Damerell, R. M. and Sands, A. D., Recursive families of graphs, J. Combinatorial Theory Ser. B 12 (1972), 123-131.
7. Birkhoff, G. D., A determinant formula for the number of ways of colouring a map, Chromatic polynomials, Ann. of Math. 14 (1912), 42-46.
8. Birkhoff, G. D. and Lewis, D. C., Chromatic polynomials, Trans. Amer. Math. Soc. 60 (1946), 355-451.
9. Brenti, F., Royle, G. F. and Wagner, D. G., Location of zeros of chromatic and related polynomials of graphs, Canad. J. Math. 46 (1994), 55-80.
10. Brooks, R. L., On colouring the nodes of a network, Proc. Cambridge Philos. Soc. 37 (1941), 194-197.
11. Edwards, H., Hierons, R. and Jackson, B., The zero-free intervals for characteristic polynomials of matroids, Combin. Probab. Comput. 7 (1998), 153-165.
12. Heawood, P. J., Map-colour theorem, Quarterly J. Pure and Applied Mathematics 24 (1890), 332-338.
13. Jackson, B., A zero-free interval for chromatic polynomials of graphs, Combin. Probab. Comput. 2 (1993), 325-336.
14. Jackson, B., Zero-free intervals for flow polynomials of near cubic graphs, in preparation.
15. Jackson, B. and Sokal, A. D., Counting subgraphs of graphs with bounded maximum flow, submitted.
16. J. L. Jacobsen, L. Salas and A. D. Sokal, Transfer matrices and partition function zeros for antiferromagnetic Potts models. III. Triangular lattice chromatic polynomial, submitted.
17. Jaeger, F., Flows and generalized colouring theorems in graphs, J. Combinatorial Theory Ser. B 26 (1979), 205-216.
18. Jensen, T. R., and Toft, B., Graph Colouring Problems, John Wiley and sons, 1995.
19. M. Kochol, Polynomials associated with nowhere zero flows, J. Combinatorial Theory Ser. B 84 (2002), 260-269.
20. Oxley, J. G., Colouring, packing and the critical problem, Quart. J. Math. Oxford. 29 (1978) 11-22.
21. Oxley, J. G., Matroid Theory, Oxford Univ. Press, Oxford, 1992.
22. Read, R. C. and Tutte, W. T., Chromatic polynomials, Selected Topics in Graph Theory 3 L. W. Beineke and R. J. Wilson eds., Academic Press, London 1988, 15-42.
23. Robertson, N., Sanders, D., Seymour, P. and Thomas, R., The four colour theorem, J. Combinatorial Theory Ser. B 70 (1997), 2-44.
24. Salas, J. and Sokal, A. D., Transfer matrices and partition function zeros for anti-ferromagnetic Potts models. I. General theory and square lattice polynomial, J. Statist. Phys. 104 (2001), 609-699.
25. Seymour, P. D., Nowhere-zero 6-flows, J. Combinatorial Theory Ser. B 30 (1981), 130-135.
26. Shrock, R. and Tsai, S.-H., Ground state degeneracy of Potts antiferromangnets: Homeomorphic classes with non-compact W boundaries, Physica A 265 (1999), 186-223.
27. Sokal, A. D., Bounds on the complex zeros of (di)chromatic polynomials and Potts model partition functions, Combin. Probab. Comput. 10 (2001), 41-77.
28. Sokal, A. D., Chromatic roots are dense in the whole complex plane, preprint.
29. Sokal, A. D., personal communication.
30. Thomassen, C., On the number of hamiltonian cycles in bipartite graphs, Combin. Probab. Comput. 5 (1996), 437-442.
31. Thomassen, C., The zero-free intervals for chromatic polynomials of graphs, Combin. Probab. Comput. 6 (1997), 497-506.
32. Thomassen, C., Chromatic roots and hamiltonian paths, J. Combinatorial Theory Ser. B 80 (2000), 218-224.
33. Tutte, W. T., Tutte, On the imbedding of linear graphs in surfaces, Proc London Math. Soc. 51 (1950), 474-483.
34. Tutte, W. T., A contribution to the theory of chromatic polynomials, Canad. J. Math. 6 (1954), 80-91.
35. Tutte, W. T., On Chromatic polynomials and the golden ratio, J. Combinatorial Theory Ser. B 9 (1970), 289-296.
36. Tutte, W. T., More about chromatic polynomials and the golden ratio, in Combinatorial Structures and their Applications Guy, R., Hanani, H., Sauer, N. W. and Schonheim, J. eds., Gordan and Breach 1970, 439-453.
37. Tutte, W. T., Chromials, Springer Lecture Notes in Mathematics 411 (1974), 243-266.
38. Wakelin, C. D., Chromatic Polynomials, Ph.D. Thesis, University of Nottingham, 1994.
39. Welsh, D. J. A., Matroid Theory, Academic Press, London, New York and San Francisco, 1976.
40. Welsh, D. J. A., personal communication.
41. Whitney, H., A logical expansion in mathematics, Bull Amer. Math. Soc. 38 (1932), 572-579.
42. Whitney, H., The coloring of graphs, Ann. of Math. 33 (1932), 688-718.
43. Woodall, D. R., Zeros of chromatic polynomials, in Combinatorial Surveys (ed. P. Cameron), Proc. Sixth British Combinatorial Conference, Academic Press, London 1977, 199-223.
44. Woodall, D. R., A zero-free interval for chromatic polynomials, Discrete Math. 101 (1992), 333-341.
45. Woodall, D. R., The largest real zero of the chromatic polynomial, Discrete Math. 172 (1997), 141-153.
46. Woodall, D. R., personal communication.