Edge-face chromatic number of 2-connected plane graphs with high maximum degree

被引：0
作者：
Zhang Zhongfu [1 ]
Wang Weifan
Li Jingwen
Yao Bing
Bu Yuehua
机构：
[1] NW Normal Univ, Coll Math & Informat Sci, Lanzhou 730070, Peoples R China
[2] Lanzhou Jiaotong Univ, Inst Appl Math, Lanzhou 730070, Peoples R China
[3] ZheJiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China
[4] Lanzhou Jiaotong Univ, Sch Informat & Elect Engn, Lanzhou 730070, Peoples R China
来源：
ACTA MATHEMATICA SCIENTIA | 2006年 / 26卷 / 03期
基金：
中国国家自然科学基金;
关键词：
plane graph; edge-face chromatic number; edge chromatic number; maximum degree;
D O I：
10.1016/S0252-9602(06)60072-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The edge-face chromatic number chi (ef) (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 Delta(G) >= \G\ - 2 >= 9 has chi(ef) (G) = Delta(G).
引用
收藏
页码：477 / 482
页数：6
相关论文
共 11 条
12