Let K(m,n,r) denote a complete tripartite graph,this paper proved that If m≤n≤r,0≤r-m≤ and m≥,the graphs K(m,n,r) is chromatically unique except for k(,,),K(, ,),K( , ,7),K( ,,7).
Let K(m,n,r) denote a complete tripartite graph,this paper proved that If m≤n≤r,0≤r-m≤ and m≥,the graphs K(m,n,r) is chromatically unique except for k(,,),K(, ,),K( , ,7),K( ,,7).
令K(m,n,r)表示完全三部图,证明了 设m≤n≤r,0≤r-m≤,若m≥,则除去K(,,)、K(, ,)、K( , ,7)、K( ,,7)外,K(m,n,r)是色唯一图。