On the chromatic roots of generalized theta graphs
From MaRDI portal
Publication:1850569
DOI10.1006/jctb.2001.2057zbMath1023.05057arXivmath/0012033OpenAlexW2951660881WikidataQ56893275 ScholiaQ56893275MaRDI QIDQ1850569
Alan D. Sokal, Jason I. Brown, David G. Wagner, C. A. Hickman
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0012033
Related Items
The complexity of approximating the complex-valued Potts model, A dense set of chromatic roots which is closed under multiplication by positive integers, \(p\)-adic roots of chromatic polynomials, Maximizing the number of \(x\)-colorings of 4-chromatic graphs, Non-chromatic-adherence of the DP color function via generalized theta graphs, Transfer matrices and partition-function zeros for antiferromagnetic Potts models. VI. Square lattice with extra-vertex boundary conditions, Graphs with a minimal number of convex sets, Algebraic properties of chromatic roots, A little statistical mechanics for the graph theorist, On the roots of strongly connected reliability polynomials, Distinguished vertices in probabilistic rooted graphs, On list equitable total colorings of the generalized theta graph, The extremal function for two disjoint cycles, The complexity of approximating the complex-valued Potts model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limits of chromatic zeros of some families of maps
- Is the four-color conjecture almost false?
- A bibliography on chromatic polynomials
- Chromatic polynomials and order ideals of monomials
- On the Lambert \(w\) function
- Recursive families of graphs
- Limits of zeroes of recursively defined polynomials
- Chromatic Roots are Dense in the Whole Complex Plane
- A Generalization of a Theorem of Bôcher
- An introduction to chromatic polynomials
- Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation
- Chromatic polynomials and their zeros and asymptotic limits for families of graphs
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. I: General theory and square-lattice chromatic polynomial.
