On the Roots of Chromatic Polynomials
β
Jason I. Brown
π
Article
π
1998
π
Elsevier Science
π
English
β 158 KB
It is proved that the chromatic polynomial of a connected graph with n vertices and m edges has a root with modulus at least (m&1)Γ(n&2); this bound is best possible for trees and 2-trees (only). It is also proved that the chromatic polynomial of a graph with few triangles that is not a forest has a