期刊文献+

A LOWER BOUND ON COCHROMATIC NUMBER FOR LINE GRAPHS OF A KIND OF GRAPHS 被引量:8

A LOWER BOUND ON COCHROMATIC NUMBER FOR LINE GRAPHS OF A KIND OF GRAPHS
在线阅读 下载PDF
导出
摘要 ErdOs,Gimbel and Straight (1990) conjectured that if ω(G)〈5 and z(G)〉3,then z(G)≥Z(G)-2. But by using the concept of edge cochromatic number it is proved that if G is the line graph of a connected triangle-free graph with ω(G)〈5 and G≠K4, then z(G)≥X(G)-2. ErdOs,Gimbel and Straight (1990) conjectured that if ω(G)〈5 and z(G)〉3,then z(G)≥Z(G)-2. But by using the concept of edge cochromatic number it is proved that if G is the line graph of a connected triangle-free graph with ω(G)〈5 and G≠K4, then z(G)≥X(G)-2.
出处 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2006年第3期357-360,共4页 高校应用数学学报(英文版)(B辑)
基金 Supported by the Natural Science Foundation of Gansu Province (3ZS051-A25-025).
关键词 cochromatic number edge cochromatic number MATCHING star. cochromatic number,edge cochromatic number,matching,star.
  • 相关文献

参考文献4

  • 1Bondy J A,Murty U S R.Graph Theory with Applications,New York:Macmillan,1976.
  • 2Lesniak L,Straight H J.The cochromatic number of a graph,Ars Combin,1977,3:34-46.
  • 3Erdos P,Gimbel J,Straight H J.Chromatic number versus cochromatic number in graphs with bounded clique size,European J Combin,1990,11:235-240.
  • 4Michael M,Bruce R.Graph Cocoloring and The Probabilistic Method,Berlin:Springer,2002.

同被引文献35

引证文献8

二级引证文献34

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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