Entire chromatic number and Δ-matching of outerplane graphs

被引：1
|
作者：
Wang, WF [1 ]
Zhang, KM
机构：
[1] Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China
[2] Nanjing Univ, Dept Math, Nanjing 210093, Peoples R China
来源：
ACTA MATHEMATICA SCIENTIA | 2005年 / 25卷 / 04期
关键词：
outerplane graph; matching; entire chromatic number;
D O I：
10.1016/S0252-9602(17)30207-2
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let G be an outerplane graph with maximum degree A and the entire chromatic number chi(vef) (G). This paper proves that if Delta >= 6, then Delta + 1 <= chi(vef) (G) <= Delta + 2, and chi(vef) (G) = Delta + 1 if and only if G has a matching M consisting of some inner edges which covers all its vertices of maximum degree.
引用
收藏
页码：672 / 680
页数：9
相关论文
共 50 条
12345