Density of Chromatic Roots in Minor-Closed Graph Families

DOI10.1017/S0963548318000184zbMath1402.05109WikidataQ60198465 ScholiaQ60198465MaRDI QIDQ4554778

Thomas J. Perrett, Carsten Thomassen

Publication date: 9 November 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Related Items (2)

Unnamed Item ⋮ Approximating the chromatic polynomial is as hard as computing it exactly

Cites Work

• Planar triangulations with real chromatic roots arbitrarily close to 4
• Über eine Eigenschaft der ebenen Komplexe
• A Zero-Free Interval for Chromatic Polynomials of Graphs
• The Zero-Free Intervals for Chromatic Polynomials of Graphs
• Chromatic Roots are Dense in the Whole Complex Plane
• THE GOLDEN RATIO IN THE THEORY OF CHROMATIC POLYNOMIALS.
• Chromatic Polynomials
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. I: General theory and square-lattice chromatic polynomial.

This page was built for publication: Density of Chromatic Roots in Minor-Closed Graph Families