Roots of chromatic polynomials
From MaRDI portal
The chromatic polynomial \(P(G,\lambda)\) of a graph \(G\) with chromatic number \(\chi\) has a root with modulus at least \([m- ({\chi\over 2})]/(n- \chi)\), where \(n (m)\) is the number of vertices (edges) of \(G\). This bound is proved to be best possible for \((\chi-1)\)-trees only. A sufficient condition for complex roots of \(P(G,\lambda)\) in terms of the numbers of triangles, 4-cycles and complete graphs of order 4 in the graph \(G\) is given, too.
Recommendations
Cited in
(25)- On the roots of chromatic polynomials
- Subdivisions and chromatic roots
- The largest real zero of the chromatic polynomial
- On upper bounds for real roots of chromatic polynomials
- Chromatic roots and Hamiltonian paths
- On the chromatic roots of generalized theta graphs
- Necessary condition for a chromatic polynomial
- p-adic roots of chromatic polynomials
- New bounds for chromatic polynomials and chromatic roots
- A note on the real part of complex chromatic roots
- Graphs and the multiplicity of root 2 in chromatic polynomials
- Chromatic roots and minor-closed families of graphs
- Pisot numbers and chromatic zeros
- Chromatic bounds on orbital chromatic roots
- Chromatic Roots are Dense in the Whole Complex Plane
- scientific article; zbMATH DE number 773170 (Why is no real title available?)
- Chromatic roots at 2 and the Beraha number B10
- Algebraic properties of chromatic roots
- On the imaginary parts of chromatic roots
- scientific article; zbMATH DE number 2188422 (Why is no real title available?)
- Chromatic roots of a ring of four cliques
- Foundations of the chromatic polynomial
- On chromatic roots of large subdivisions of graphs
- On the location of roots of graph polynomials
- A little statistical mechanics for the graph theorist
This page was built for publication: Roots of chromatic polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5937579)
