| EDGE-FACE CHROMATIC NUMBER OF 2-CONNECTED PLANE GRAPHS WITH HIGH MAXIMUM DEGREE |
| |
| 作者姓名： | 张忠辅 王维凡 李敬文 姚兵 卜月华 |
| |
| 作者单位： | College of Mathematics and Information Science Northwest Normal University Lanzhou 730070，China Institute of Applied Mathematics，Lanzhou Jiaotong University，Lanzhou 730070，China，Department of Mathematics ZheJiang Normal University，Jinhua 321004，China，School of Information and Electrical Engineering Lanzhou Jiaotong University，Lanzhou 730070，China，College of Mathematics and Information Science Northwest Normal University，Lanzhou 730070，China，Department of Mathematics ZheJiang Normal University，Jinhua 321004，China |
| |
| 基金项目： | This research is supported by NNSF of China(40301037, 10471131) |
| |
| 摘 要： | 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).
|
| 关 键 词： | 平面图 边缘面彩色数 极大度数 图论 |
| 收稿时间： | 2004-08-06 |
EDGE-FACE CHROMATIC NUMBER OF 2-CONNECTED PLANE GRAPHS WITH HIGH MAXIMUM DEGREE |
| |
| 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,2006,26(3):477-482. |
| |
| Authors: | Zhang Zhongfu Wang Weifan Li Jingwen Yao Bing Bu Yuehua |
| |
| Abstract: | 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). |
| |
| Keywords: | Plane graph edge-face chromatic number edge chromatic number maximum degree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
