Acta mathematica scientia, Series B >
EDGE-FACE CHROMATIC NUMBER OF 2-CONNECTED PLANE GRAPHS WITH HIGH MAXIMUM DEGREE
Received date: 2004-08-06
Revised date: 1900-01-01
Online published: 2006-07-20
The edge-face chromatic number χ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 △(G)≥ |G|-2≥ 9 has χef(G)=△(G).
Zhang Zhongfu , Wang Weifan , Li Jingwen , Yao Bing , Bu Yuehua . EDGE-FACE CHROMATIC NUMBER OF 2-CONNECTED PLANE GRAPHS WITH HIGH MAXIMUM DEGREE[J]. Acta mathematica scientia, Series B, 2006 , 26(3) : 477 -482 . DOI: 10.1016/S0252-9602(06)60072-6
/
| 〈 |
|
〉 |