数学物理学报(英文版)

• 论文 • 上一篇    下一篇

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

张忠辅; 王维凡; 李敬文; 姚兵; 卜月华   

  1. 西北师范大学数学与信息学院, 兰州 730070
  • 收稿日期:2004-08-06 修回日期:1900-01-01 出版日期:2006-07-20 发布日期:2006-07-20
  • 通讯作者: 张忠辅
  • 基金资助:

    This research is supported by NNSF of China(40301037, 10471131)

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

PDF (PC)

1011

摘要：

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).

关键词: Plane graph, edge-face chromatic number, edge chromatic number, maximum degree

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

中图分类号: 

  • 05C15
版权所有 © 《数学物理学报(英文版)》杂志社
地址：武汉市71010号信箱(430071)　电话: 027-87199206(中文版)　027-87199087(英文版)
E-mail: actams@apm.ac.cn
本系统由北京玛格泰克科技发展有限公司设计开发