期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A LOWER BOUND ON COCHROMATIC NUMBER FOR LINE GRAPHS OF A KIND OF GRAPHS 被引量:8
1
作者 Liu Xinsheng Chen Xiang'en Ou Lifeng 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2006年第3期357-360,共4页
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 triang... 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. 展开更多
关键词 cochromatic number edge cochromatic number MATCHING star.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部