数学物理学报(英文版)

• 论文 • 上一篇    下一篇

ENTIRE CHROMATIC NUMBER AND -MATCHING OF OUTERPLANE GRAPHS

王维凡,张克民   

  1. Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China Department of Mathematics, Nanjing University, Nanjing 210093, China
  • 出版日期:2005-10-11 发布日期:2005-10-11
  • 基金资助:

    Research supported partially by NSFC(10471131) and
    ZJNSF(M103094)

ENTIRE CHROMATIC NUMBER AND -MATCHING OF OUTERPLANE GRAPHS

 WANG Wei-Fan, ZHANG Ke-Min   

  • Online:2005-10-11 Published:2005-10-11
  • Supported by:

    Research supported partially by NSFC(10471131) and
    ZJNSF(M103094)

PDF (PC)

729

摘要：

Let G be an outerplane graph with maximum degree  and the entire chro-
matic 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.

Abstract:

Let G be an outerplane graph with maximum degree  and the entire chro-
matic 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.

Key words: Outerplane graph, matching, entire chromatic number

中图分类号: 

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