Dong, F. M. and Jackson, B. (2011) A zero-free interval for chromatic polynomials of nearly 3-connected plane graphs. SIAM J. Discrete Math.
Goldberg, L. A. and Jerrum, M. (2008) Inapproximability of the Tutte polynomial. Inform. Comput.
Goldberg, L. A. and Jerrum, M. (2012) Inapproximability of the Tutte polynomial of a planar graph. Comput. Complexity
Goldberg, L. and Jerrum, M. (2014) The complexity of computing the sign of the Tutte polynomial. SIAM J. Comput.
Jackson, B. (1993) A zero-free interval for chromatic polynomials of graphs. Combin. Probab. Comput.
Jackson, B. and Sokal, A. (2009) Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids. J. Combin. Theory Ser. B
Jacobsen, J. and Salas, J. (2013) Is the five-flow conjecture almost false?
J. Combin. Theory Ser. B
Jaeger, F., Vertigan, D. L. and Welsh, D. J. A. (1990) On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Cambridge Philos. Soc.
Royle, G. and Sokal, A. (2015) Linear bound in terms of maxmaxflow for the chromatic roots of series-parallel graphs. SIAM J. Discrete Math.
Sokal, A. (2004) Chromatic roots are dense in the whole complex plane. Combin. Probab. Comput.
Sokal, A. (2005) The multivariate Tutte polynomial (alias Potts model) for graphs and matroids. In Surveys in Combinatorics, 2005 (Webb, B., ed.), Cambridge University Press, pp. 173–226.
Thomassen, C. (1997) The zero-free intervals for chromatic polynomials of graphs. Combin. Probab. Comput.
Tutte, W. (1974) Chromials. In Hypergraph Seminar (Berge, C. and Ray-Chaudhuri, D., eds), Vol. 411 of Lecture Notes in Mathematics, Springer, pp. 243–266.