| With Comparing the numbers of partions into r color classes of two chromatically equivalent graphs, a general numerical condition is established to guarante that the equivalent graphs of complete t-partite graphs K(n1,n2…nt) are still complete t-partite graphs. Furthermore, two general numerical conditions are obtained, under which K(n1,n2,nt) and K(n1,n2,n3,n4) are chromatically unique. |
