EDGE-FACE CHROMATIC NUMBER OF 2-CONNECTED PLANE GRAPHS WITH HIGH MAXIMUM DEGREE

被引：0

作者：

张忠辅 ^{[1
]}

王维凡 ^{[2
]}

李敬文 ^{[3
]}

姚兵 ^{[4
]}

卜月华 ^{[2
]}

机构：

[1] College of Mathematics and Information Science Northwest Normal University,Lanzhou ,China Institute of Applied Mathematics,Lanzhou Jiaotong University,Lanzhou ,China

[2] Department of Mathematics ZheJiang Normal University,Jinhua ,China

[3] School of Information and Electrical Engineering Lanzhou Jiaotong University,Lanzhou ,China

[4] College of Mathematics and Information Science Northwest Normal University,Lanzhou ,China

来源：

ActaMathematicaScientia | 2006年 / 03期

关键词：

Plane graph; edge-face chromatic number; edge chromatic number; maximum degree;

D O I：

暂无

中图分类号：

O157.5 [图论];

学科分类号：

070104 ;

摘要：

<正>The edge-face chromatic number Xef (G) of a plane graph G is the least number of colors assigned to the edges and faces such that every adjacent or incident pair of them receives different colors. In this article, the authors prove that every 2-connected plane graph G with△(G)≥|G| -2△9 has Xef(G)=△(G).

引用

页码：477 / 482

页数：6