Acta mathematica scientia,Series B
• Articles • Previous Articles Next Articles
Zhang Zhongfu; Wang Weifan; Li Jingwen; Yao Bing; Bu Yuehua
Received:
Revised:
Online:
Published:
Contact:
Abstract:
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).
Key words: Plane graph, edge-face chromatic number, edge chromatic number, maximum degree
CLC Number:
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.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: http://121.43.60.238/sxwlxbB/EN/10.1016/S0252-9602(06)60072-6
http://121.43.60.238/sxwlxbB/EN/Y2006/V26/I3/477
Cited