| ENTIRE CHROMATIC NUMBER AND △-MATCHING OF OUTERPLANE GRAPHS |
| |
| 引用本文： | 王维凡,张克民.ENTIRE CHROMATIC NUMBER AND △-MATCHING OF OUTERPLANE GRAPHS[J].数学物理学报(B辑英文版),2005,25(4):672-680. |
| |
| 作者姓名： | 王维凡 张克民 |
| |
| 作者单位： | [1]Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China [2]Department of Mathematics, Nanjing University, Nanjing 210098, China |
| |
| 基金项目： | Research supported partially by NSFC（10471131） and ZJNSF（M103094） |
| |
| 摘 要： | Let G be an outerplane graph with maximum degree A and the entire chromatic number Xvef（G）. This paper proves that if △ ≥6, then △＋ 1≤Xvef（G）≤△＋ 2, and Xvef （G） = △＋ 1 if and only if G has a matching M consisting of some inner edges which covers all its vertices of maximum degree.
|
| 关 键 词： | 外平面图 △匹配 色数 顶点集 最大度数 |
| 收稿时间： | 2003-03-28 |
| 修稿时间： | 2004-05-30 |
ENTIRE CHROMATIC NUMBER AND Δ-MATCHING OF OUTERPLANE GRAPHS |
| |
| Wang Weilan,Zhang Kemin.ENTIRE CHROMATIC NUMBER AND Δ-MATCHING OF OUTERPLANE GRAPHS[J].Acta Mathematica Scientia,2005,25(4):672-680. |
| |
| Authors: | Wang Weilan Zhang Kemin |
| |
| Institution: | 1. School of Management, Beijing University of Chinese Medicine, Beijing 100029, China;2. Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China |
| |
| Abstract: | Let G be an outerplane graph with maximum degree Δ and the entire chromatic number χvef (G). This paper proves that if Δ ≥ 6, then Δ + 1 ≤ χvef (G) ≤ Δ + 2, and χvef (G) = Δ + 1 if and only if G has a matching M consisting of some inner edges which covers all its vertices of maximum degree. |
| |
| Keywords: | Outerplane graph matching entire chromatic number |
| 本文献已被 维普 ScienceDirect 等数据库收录！ |
