完全三部图K(2,4,6)的色唯一性

The Chromaticity of the Complete Tripartite Graph K(2,4,6)

设G是简单图，用P（G，λ）表示图G的色多项式．若对任意图H使P（H，λ）＝P（G，λ），都有H与G同构，则称G是色唯一图．作者证明了：完全三部囹K（2，4，6）是色唯一图．从而解决了文[1]中的一个遗留问题．

Let G be a simple graph and P(G,A) denote the chromatlc polynomial of G. Then G is said to be chromatically unique if for any graph H, P(H,λ) = P(G,λ) implies the H is isomorphic to G. We prove that the complete tripartite graph K(2,4, 6) is chromatically unique. This solves a problem in [1].