Chromatic Equivalence Graphs of Complete Tripartite Graphs
Shumin Zhang · Journal of Gansu Lianhe University · 2011
Some necessary conditions on a graph which shares the same chromatic polynomial as that of a complete tripartite graph Km,n,r are developed.Using these,the chromatic equivalence classes for Km,n,n(where 1≤m≤n) were obtained.In particular,it is shown that Km,n,n(where 2≤m≤n) are uniquely determined by their chromatic polynomials.