ENTIRE CHROMATIC NUMBER AND △-MATCHING OF OUTERPLANE GRAPHS
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.
作 者： Wang Weifan Zhang Kemin 作者單位： Wang Weifan(Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China)Zhang Kemin(Department of Mathematics, Nanjing University, Nanjing 210093, China)
刊 名： 數(shù)學(xué)物理學(xué)報（英文版） ISTIC SCI 英文刊名： ACTA MATHEMATICA SCIENTIA 年，卷(期)： 2005 25(4) 分類號： O4 關(guān)鍵詞： Outerplane graph matching entire chromatic number【ENTIRE CHROMATIC NUMBER AND △-MATCHI】相關(guān)文章：
考研熱降溫了 The Decreasing Number of Postgraduate Candidates11-06
Whats your room number?你的房間號是多少05-04
The flight number is BA 038航班號是BA 03805-04