The largest real zero of the chromatic p
โ
D.R. Woodall
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 507 KB
It is proved that if every subcontraction of a graph G contains a vertex with degree at most k, then the chromatic polynomial of G is positive throughout the interval (k, c~); Kk+l shows that this interval is the largest possible. It is conjectured that the largest real zero of the chromatic polynom