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

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）...

Full description

Saved in:
Bibliographic Details
Published inActa Mathematica Scientia Vol. 26; no. 3; pp. 477 - 482
Main Author 张忠辅 王维凡 李敬文 姚兵 卜月华
Format Journal Article
LanguageEnglish
Published 01.07.2006
Subjects
平面图
极大度数
边缘面彩色数
maximum degree
edge chromatic number
edge-face chromatic number
Plane graph
Online AccessGet full text
ISSN0252-9602
1572-9087
1003-3998
DOI10.1016/S0252-9602(06)60072-6

Cover

More Information
Summary: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）.
Bibliography:Plane graph, edge-face chromatic number, edge chromatic number, maximum degree
O157.5
42-1227/O
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0252-9602
1572-9087
1003-3998
DOI:10.1016/S0252-9602(06)60072-6