Fetching the paper…
Reading the bibliography…
We prove that the (real or complex) chromatic roots of a series-parallel graph with maxmaxflow Lambda lie in the disc |q-1| < (Lambda-1)/log 2.
G.D. Birkhoff and D.C. Lewis, Chromatic polynomials, Trans. Amer. Math. Soc. 60
1946
Earlier work this paper cites.
R.J. Duffin, Topology of series-parallel graphs, J. Math. Anal. Appl. 10
1965
Earlier work this paper cites.
W. Rudin, Function Theory in Polydiscs
1969
Earlier work this paper cites.
N.L. Biggs, R.M. Damerell and D.A. Sands, Recursive families of graphs. J. Combin. Theory B 12
1972
Earlier work this paper cites.
E.J. Farrell, Chromatic roots — some observations and conjectures, Discrete Math. 29
1980
Earlier work this paper cites.
J. Valdes, R.E. Tarjan and E.L. Lawler, The recognition of series parallel digraphs, SIAM J. Comput. 11
1982
Earlier work this paper cites.
M.Y. Lyubich, An analysis of the stability of the dynamics of rational functions, Selecta Math. Sovietica 9
1984
Earlier work this paper cites.
J. Oxley, Graphs and series-parallel networks, in Theory of Matroids
1986
Earlier work this paper cites.
M.W. Bern, E.L. Lawler and A.L. Wong, Linear-time computation of optimal subgraphs of decomposable graphs, J. Algorithms 8
1987
Earlier work this paper cites.
C.J. Colbourn, The Combinatorics of Network Reliability
1987
Earlier work this paper cites.
A.F. Beardon, Iteration of Rational Functions
1991
Earlier work this paper cites.
R.B. Borie, R.G. Parker and C.A. Tovey, Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Algorithmica 7
1992
Earlier work this paper cites.
J.G. Oxley, Matroid Theory
1992
Earlier work this paper cites.
L. Carleson and T.W. Gamelin, Complex Dynamics
1993
Earlier work this paper cites.
J. Milnor, Geometry and dynamics of quadratic rational maps, with an appendix by the author and Lei Tan, Experiment. Math. 2
1993
Earlier work this paper cites.
N. Steinmetz, Rational Iteration
1993
Earlier work this paper cites.
F. Brenti, G.F. Royle and D.G. Wagner, Location of zeros of chromatic and related polynomials of graphs, Canad. J. Math. 46
1994
Earlier work this paper cites.
R.M. Corless, G.H. Gonnet, D.E.G. Hare, D.J. Jeffrey and D.E. Knuth, On the Lambert W W function, Adv. Comput. Math. 5
1996
Cited alongside, same era.
J.R. Bobenrieth, Algunos aspectos de la dinámica de las funciones racionales z ↦ 1 + 1 / ω z d z\mapsto 1+1/\omega z^{d} , Ph.D. thesis, Universidad de Chile (June 1997)
1997
Cited alongside, same era.
C. Thomassen, The zero-free intervals for chromatic polynomials of graphs, Combin. Probab. Comput. 6
1997
Cited alongside, same era.
R. Shrock and S.-H. Tsai, Ground-state degeneracy of Potts antiferromagnets: cases with noncompact W W boundaries having multiple points at 1 / q = 0 1/q=0 , J. Phys. A: Math. Gen. 31
1998
Cited alongside, same era.
R. Bamón and J. Bobenrieth, The rational maps z ↦ 1 + 1 / ω z d z\mapsto 1+1/\omega z^{d} have no Herman rings, Proc. Amer. Math. Soc. 127
1999
J. Bobenrieth, Parabolic perturbation in the family z ↦ 1 + 1 / w z d z\mapsto 1+1/wz^{d} , Proyecciones 21
2002
Later among the works it cites.
Q.I. Rahman and G. Schmeisser, Analytic Theory of Polynomials
2002
Later among the works it cites.
B. Jackson, Zeros of chromatic and flow polynomials of graphs, J. Geom. 76
2003
Later among the works it cites.
J.P. Spinrad, Efficient Graph Representations
2003
Later among the works it cites.
G. Royle and A.D. Sokal, The Brown–Colbourn conjecture on zeros of reliability polynomials is false, J. Combin. Theory B 91
2004
Later among the works it cites.
A.D. Sokal, Chromatic roots are dense in the whole complex plane, Combin. Probab. Comput. 13
2004
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A. Brandstädt, V.B. Le and J.P. Spinrad, Graph Classes: A Survey
1999
Cited alongside, same era.
R. Shrock and S.-H. Tsai, Ground-state degeneracy of Potts antiferromagnets: homeomorphic classes with noncompact W W boundaries, Physica A 265
1999
Cited alongside, same era.
D.A. Bini and G. Fiorentino, Numerical computation of polynomial roots using MPSolve version 2.2 (January 2000). Software package and documentation available for download at http://www.dm.unipi.it/cluster-pages/mpsolve/
2000
Cited alongside, same era.
D.A. Bini and G. Fiorentino, Design, analysis, and implementation of a multiprecision polynomial rootfinder, Numer. Algorithms 23
2000
Cited alongside, same era.
J. Bobenrieth, Hyperbolic components of the family z ↦ 1 + 1 / w z d z\mapsto 1+1/wz^{d} , preprint (2000)
2000
Cited alongside, same era.
J. Milnor, On rational maps with two critical points, Experiment. Math. 9
2000
Cited alongside, same era.
2000
Cited alongside, same era.
A.D. Scott and A.D. Sokal, The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma, J. Stat. Phys. 118
2005
Later among the works it cites.
A.D. Sokal, The multivariate Tutte polynomial (alias Potts model) for graphs and matroids, in Surveys in Combinatorics, 2005
2005
Later among the works it cites.
C. Borgs, Absence of zeros for the chromatic polynomial of bounded degree graphs, Combin. Probab. Comput. 15
2006
Later among the works it cites.
G. Grimmett, The Random-Cluster Model
2006
Later among the works it cites.
J. Milnor, Dynamics in One Complex Variable
2006
Later among the works it cites.
2008
Later among the works it cites.
2009
Later among the works it cites.
G.F. Royle, Recent results on chromatic and flow roots of graphs and matroids, in Surveys in Combinatorics, 2009
2009
Later among the works it cites.
B. Jackson and A.D. Sokal, Maxmaxflow and counting subgraphs, Electron. J. Combin. 17
2010
Later among the works it cites.