期刊文献+

由轮图导出的某些平面图类的星色数

The Star Chromatic Numbers of Some Planar Graphs Derived from Wheek
原文传递
导出
摘要 图的星色数是通常色数概念的推广.本文求出了几类由轮图导出的平面图的星色数.前两类是由3-或5-轮图经细分等构造出的,其星色数分别为2+2/(2n+1),2+3/(3n+1)和2+3/(3n-1).第三类平面图是由n-轮图经过Hajos构造得到的,其星色数为3+1/n.本类图的星色数结果推广了已有结论. The notion of star chromatic number of a graph is a generalization of the chromatic number. In this paper, we calculate the star chromatic numbers of three infinite families of planar graphs. The first two families are derived from a 3-or 5-wheel by subdivisions, their star chromatic numbers being 2 + 2/(2n + 1), 2 + 3/(3n + 1) and 2 + 3/(3n - 1) separately. The third family of planar graphs are derived from n odd wheels by Hajos construction with star chromatic numbers 3 + 1/n, which is a generalization of the result of Gao et al.
作者 李德明
出处 《数学学报(中文版)》 SCIE CSCD 北大核心 2004年第5期1031-1036,共6页 Acta Mathematica Sinica:Chinese Series
基金 国家自然科学基金资助项目
关键词 (k d)-着色 星色数 平面图 (k,d)- coloring Star chromatic number Planar graph
  • 相关文献

参考文献8

  • 1Vince A., Star chromatic number, J. Graph Theory, 1988, 12: 551-559.
  • 2Bondy J. A., Hell P., A note on the star chromatic number, J. Graph Theory, 1990, 14: 479-482.
  • 3Gao G., Wang Y., Zhou H., Star chromatic number of some planar graphs, J. Graph Theory, 1998, 27: 33-42.
  • 4Zhou B., Some theorems concerning the star chromatic number of a graph, J. Combin. Theory B, 1997, 70:245-258.
  • 5Abbott H. L., Zhou B., The star chromatic number ofa graph, J. Graph Theory, 1993, 17: 349-360.
  • 6Moser D., The Star-chromatic number of planar graphs, J. Graph Theory, 1997, 24: 33-43.
  • 7Zhu X., Star-chromatic numbers and products of graphs, J. Graph Theory, 1992, 16: 557-569.
  • 8Guichard D. R., Acyclic graph coloring and the complexity of the star chromatic number, J. Graph Theory,1993, 17: 129-134.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部