完全t部图K(n1,n2…nt)的色唯一性

On the Chromaticity of Complete t -partite Graphs K(n1,n2…nt)

中文关键词:  完全t部图  色等价和色唯一图  色划分

英文关键词:complete t-partite graph  chromatically equivalent and unique graph  partition into colour classes.

中文摘要:

      本文使用比较两个色等价图的色划分数的方法,得出了完全t部图的色等价图类仍为完全t部图的一般形式数值条件,进一步得出了K(n₁,n₂,n₃)和K(n₁,n₂,n₃,n₄)为色唯一图的一般形式数值条件。

英文摘要:

      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(n₁,n₂…n_t) are still complete t-partite graphs. Furthermore, two general numerical conditions are obtained, under which K(n₁,n₂,n_t) and K(n₁,n₂,n₃,n₄) are chromatically unique.