Chromatic polynomials and their zeros and asymptotic limits for families of graphs
From MaRDI portal
Publication:5937607
DOI10.1016/S0012-365X(00)00336-8zbMath0973.05032arXivcond-mat/9908387MaRDI QIDQ5937607
Publication date: 28 November 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/9908387
Related Items (17)
Chromatic zeros on hierarchical lattices and equidistribution on parameter space ⋮ Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial ⋮ Independence densities of hypergraphs ⋮ Zeros of the Jones polynomials for families of pretzel links ⋮ Transfer matrices and partition-function zeros for antiferromagnetic Potts models. VI. Square lattice with extra-vertex boundary conditions ⋮ Tutte polynomials and related asymptotic limiting functions for recursive families of graphs ⋮ Recursively constructible families of graphs ⋮ q-plane zeros of the Potts partition function on diamond hierarchical graphs ⋮ A little statistical mechanics for the graph theorist ⋮ On the roots of domination polynomials ⋮ Distinguished vertices in probabilistic rooted graphs ⋮ A generalized Beraha conjecture for non-planar graphs ⋮ Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs ⋮ Study of exponential growth constants of directed heteropolygonal Archimedean lattices ⋮ Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids ⋮ Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\) ⋮ On the chromatic roots of generalized theta graphs
This page was built for publication: Chromatic polynomials and their zeros and asymptotic limits for families of graphs