Chinese Quarterly Journal of Mathematics ›› 1999, Vol. 14 ›› Issue (4): 76-83.

Previous Articles     Next Articles

Edge-Face Chromatic Number of 1-Trees

  

  1.  辽宁大学数学系 辽宁沈阳110036 
  • Received:1998-12-18 Online:1999-12-30 Published:2024-09-06
  • About author:WANG Wei-fan(1955-),male,native of Xingcheng,Liaoning,Doctor in Mathematics,professor of Liaoning University,engages in graph theory and combinatorics.

Abstract: 一个平面图G被称为1-树如果存在一个顶点u 使得G- u 是一个林.本文确定了所有1-树的边面全色数的精确上、下界,并且求出了2-连通且最大度至少为6平面图的边面全色数. 

Key words:  , 边面全色数, 1-树,

CLC Number: