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
05C15: Coloring of graphs and hypergraphs
Related Items
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\)