论文信息 - The Zero-Free Intervals for Chromatic Polynomials of Graphs

The Zero-Free Intervals for Chromatic Polynomials of Graphs

The maximal zero-free intervals for chromatic polynomials of graphs are precisely (−∞, 0), (0, 1), (1, 32/27]. We also investigate the distribution of zeros of chromatic polynomials in various classes of graphs closed under minors. For example, the zeros of chromatic polynomials of graphs of tree-width at most k consist of 0, 1 and a dense subset of the interval (32/27, k].

Carsten Thomassen | C. Thomassen

[1] Joseph Kahane,et al. Is the four-color conjecture almost false? , 1979, J. Comb. Theory B.

[2] Bill Jackson,et al. A Zero-Free Interval for Chromatic Polynomials of Graphs , 1993, Combinatorics, Probability and Computing.

[3] Edward Allburn,et al. Graph decomposition , 1990 .

[4] R. M. Damerell,et al. Recursive families of graphs , 1972 .

[5] Douglas R. Woodall. The largest real zero of the chromatic polynomial , 1997, Discret. Math..

[6] W. Mader. Homomorphieeigenschaften und mittlere Kantendichte von Graphen , 1967 .

[7] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .

[8] Carsten Thomassen,et al. Tilings of the torus and the Klein bottle and vertex-transitive graphs on a fixed surface , 1991 .

[9] K. Wagner. Über eine Eigenschaft der ebenen Komplexe , 1937 .

[10] Douglas R. Woodall,et al. A zero-free interval for chromatic polynomials , 1992, Discret. Math..

[11] G. Royle,et al. Location of Zeros of Chromatic and Related Polynomials of Graphs , 1994, Canadian Journal of Mathematics.