Chromatic polynomials and their zeros and asymptotic limits for families of graphs

DOI10.1016/S0012-365X(00)00336-8zbMath0973.05032arXivcond-mat/9908387MaRDI QIDQ5937607

Robert Shrock

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

zbMATH Keywords

chromatic polynomial; Tutte polynomial; chromatic zeros

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

A little statistical mechanics for the graph theorist, Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids, Zeros of the Jones polynomials for families of pretzel links, Tutte polynomials and related asymptotic limiting functions for recursive families of graphs, Recursively constructible families of graphs, On the chromatic roots of generalized theta graphs, Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial, Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\), Distinguished vertices in probabilistic rooted graphs