Proof of a Chromatic Polynomial Conjectu
โ
F.M. Dong
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 138 KB
Let P(G, \*) denote the chromatic polynomial of a graph G. It is proved in this paper that for every connected graph G of order n and real number \* n, (\*&2) n&1 P(G, \*)&\*(\*&1) n&2 P(G, \*&1) 0. By this result, the following conjecture proposed by Bartels and Welsh is proved: P(G, n)(P(G, n&1))