关于完备色数（Ⅰ）

On the Complete Chromatic Number of Graphs(I)

平面图Ｇ（Ｖ，Ｅ，Ｆ）的完备色数ｘ＿ｃ（Ｇ）是使得集合Ｖ∪Ｅ∪Ｆ中相邻和相关联的元素均染为不同颜色的最少颜色数．本文证明了：若Ｇ为△（Ｇ）＝６的无割点外平面图，且还满足性质Ａ或性质Ｂ，则ｘ＿ｃ（Ｇ）＝７，其中△（Ｇ）为Ｇ的顶点最大度．

In this paper,we prove that if G is an outerplanar graph withoutcut vertex and with △(G)= 6 and satisfies both property A or property B,thenx_c(G)=7,where x_c(G)is the complete chromatic number of G,△(G)the maximumdegree of G.