三角剖分图的点面全色数  

The Vertex-Face Total Chromatic Number of Plane Triangulation Graphs.

作　　者：王维凡[1] 

机构地区：[1]辽宁大学数学系

出　　处：《辽宁大学学报（自然科学版）》1993年第2期1-6,共6页Journal of Liaoning University：Natural Sciences Edition

摘　　要：平面图G(V,E,F)的点面全色数X_e(G)是使得集合V(G)∪F(G)中相邻和相关联的元素均染为不同颜色的最少颜色数。本文证明了:若G是三角剖分图,则4≤X_e(G)≤6。Let G(V,E,F) be a planar graph, the vertex-face total chromatic number xe(G) of G is the minimum colours required for colouring the elements V(G)∪F(G)of G, so that adjacent or incident elements are of different colours. In this paper, we proved that if G is a plane triangulation graph, then 4≤xe(G)≤6.

关 键 词：三角剖分图 染色 点面全色数 

分 类 号：O157.5[理学—数学]