最大度等于5的2-连通的1-树图的边面色数

• 作 者: 董桂香 陈东灵 许振宇
• 机 构: Department of Mathematics and Physics,Shandong Institute of Architecture and Engineering,Jinan250014
• 出 处: 数学季刊(英文版)
• 发表日期: 2004年期
• 关键词: edge-face chromatic number 1-tree

Wang Wei-fan[1] proved that the edge-face chromatic number of a 2-connected 1-tree with the maximum degree is not less than 6 is its maximum degree,and he conjectured that it is true when the maximum degree is 5.This paper proves the conjecture.