Hits :

First Author : Wang

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2005-01-01

Document Type : 期刊

Journal : 数学物理学报(B辑)(英文版)

Volume: 第25卷

Issue : 第4期

Page Number : 672-680

ISSN : 0252-9602

Translation or Not : no

Key Words : Outerplane；graph；matching；entire；chromatic；number

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