期刊文献+

图的星色数(英文) 被引量:1

The Star Chromatic Numbersof Some Graphs
下载PDF
导出
摘要 给出了一些星色数为4的平面图,它们不含有轮图作为子图.这回答了Zhu的一个问题,给出了一类4连通平面图其星色数在3与4之间,这也回答了Abbott和Zhou的一个问题.应用图的同态概念,讨论了某些图的字典积的星色数,证明了一个图及其补图的星色数的和与积所满足的两个不等式. It is proven in this paper that some planar graphs have star chromatic number 4but do not have an odd wheel graph as their subgraph. This answers one question of Zhu. Infinitelymaily 4-connected planar graphs with star chromatic number between 3 and 4 are also provided, whichanswers a question asked by Abbott and Zhou. The star chromatic number of the wreath productof some graphs are studied furtherly by graph homomorphisms. Two inequalities on the sum andproduct of the star chromatic numbers of a graph and its complement are proved.
作者 李德明
出处 《数学进展》 CSCD 北大核心 1999年第3期259-265,共7页 Advances in Mathematics(China)
关键词 着色 星色数 字典积 同态 补图 平面图 :(k, d)-coloring star chromatic number wreath product homomorphism
  • 相关文献

参考文献5

  • 1Steffen E,Combinatorica,1996年,16期,439页
  • 2Gao Guogang,Discrete Math,1996年,152卷,147页
  • 3Abbott H L,J Graph Theory,1993年,17卷,349页
  • 4Albertson M O,J Graph Theory,1993年,17卷,581页
  • 5Zhu Xuding,J Graph Theory,1992年,16卷,557页

同被引文献13

  • 1李鸿祥,张忠铺,张建勋.Halin图的色性[J].上海铁道学院学报,1994,15(1):19-24. 被引量:13
  • 2徐保根.关于Halin图的边面全着色数[J].华东交通大学学报,1995,12(3):73-77. 被引量:1
  • 3张忠辅,李敬文,赵传成,任志国,王建方.若干联图的点可区别均匀边色数[J].数学学报(中文版),2007,50(1):197-204. 被引量:15
  • 4Liu X S, An M Q, Gao Y. An upper bound for the adjacent vertex-distinguishing acyclic edge chromatic number of a graph [ J ]. Acta Mathematica Applicatae Sinica English Series, 2009,25 ( 1 ) : 137-140.
  • 5ZHANG Zhongfu, LI Jingwen, ZHAO Chuancheng, et. al. On the vertex-distinguishing-equitable edge chromatic number of some join-graphs [ J ]. Acta Mathematica Sinica,2007,50( 1 ) : 197-204.
  • 6CHEN Xiangen, GAO Yuping. Vertex-distinguishing proper edge-coloring chromatic numbers of the composition of two graphs [ J ] .Journal of Jilin University : Science Edition ,2011,49(2) :207-212.
  • 7Zhu X D.Planar graphs with circular chromatic numbers between 3 and 4[ J] .Journal of Combinatorial Theory Series B, 1999,76(2) : 170-200.
  • 8LI Hongxiang, ZHANG Zhongfu, ZHANG Jianxun. The chromatic number of Halin graphs [ J ]. Journal of Shanghai Institute of Railway Technology, 1994,15 ( 1 ) : 19-24.
  • 9Bondy J A, Lovesz L. Lengths of cycles in Halingraphs [ J ]. J Graph Theory, 2006,9 (3) : 397-410.
  • 10Zhu X D. Circular chromatic number: A survey [ J ]. Discrete Mathematics,2001,229(1/2/3) :371-410.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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