一类图的色唯一性

Chromatic uniqueness of a class graphs

利用图的色多项式和图的结构间的内在联系，以及图的色数和点的度之间的关系，把满足一定条件的图分成几种情形．证明了当ｎ ≥３ ，ｍ ≥３ 时，由完全图Ｋｎ 和圈Ｃｍ 重叠于一条边得到的一类新图是色唯一的．

The graph with definite condition is divided kinds of cases, by connection between chromatic polynomial and graph's structure and relation between chromatic number and degree. It is proved that the new graph consisting of two subgraphs K n and C m “overlaping”in a edg is chromatically unique,where n ≥3 and m ≥3.