Acta mathematica scientia,Series B

• Articles • Previous Articles     Next Articles

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)

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

CLC Number: 

  • 05C15
Trendmd