摘要本文给出了△（Ｇ）＜６的极大外平面图的边面金色数，其中△（Ｇ）表示Ｇ的最大度．In this paper the entire chromatic number of maximal outer planar graph G with △ (G)<6 are obtained,where △(G) denote maximal degree of G.
1Hu Guanzhang, Zhang Zhongfu. The edge-face-total colouring of planar graphs[J]. Journal of Tsinghua University, 1992, 32(3):18-23.
2Lin G, Hu G, zhang Z. A six-colour theorem for the edge-face colouring of plane graphs[J]. Discrete Mathematics, 1996,(141):291-297.
3Chang C F, Chang J X, Lu X C, et al. Edge-face total chromatic number of outerplanar graphs with Δ(G)=6[J]. Lecture of computer Science 959, 1995,396-399.
4Chartrand C, Lesniak L. Graphs and Digraphs (Second edition)[M]. Monterey, Cailif, Wadswordth and Brooks/Cole, 1986.
5Zhang Zhongfu, Wang Jianfang. The Complete chromatic number of some graphs[J]. Science in China (Series A), 1993, 36(10):1 169-1 178
