Acta mathematica scientia,Series B

• Articles • Previous Articles     Next Articles

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

Zhang Zhongfu; Wang Weifan; Li Jingwen; Yao Bing; Bu Yuehua   

  1. College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China
  • Received:2004-08-06 Revised:1900-01-01 Online:2006-07-20 Published:2006-07-20
  • Contact: Zhang Zhongfu

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: 

  • 05C15
Trendmd