On the chromatic equivalent classes of a kind of graphs
Haicheng Ma · Journal of Shandong University · 2006
For a graph G,let P(G,λ) be its chromatic polynomial and [G]_p be the set of graphs having P(G,λ) as their chromatic polynomial,it is said to be chromatically equivalent class of G.The _p has been determined,where I~c_m is the complement of I_m,I_m(m6) is the graph obtained by identifying each endvertex of P_(m-4) with one 2-degree vertex of P_3,respectively.