A LOWER BOUND ON COCHROMATIC NUMBER FOR LINE GRAPHS OF A KIND OF GRAPHS

被引：0
|
作者：
Liu Xinsheng~1 Chen Xiang’en~1 Ou Lifeng~2 1 College of Mathematics and Information Science
机构：
来源：
Applied Mathematics:A Journal of Chinese Universities | 2006年 / 03期
关键词：
cochromatic number; edge cochromatic number; matching; star;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
070104 ;
摘要：
Erds,Gimbel and Straight （1990） conjectured that ifω（G）＜5 and z（G）＞3,then z（G）≥x（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≠K;,then z（G）≥x（G）- 2.
引用
收藏
页码：357 / 360
页数：4
相关论文
共 50 条
  • [41] A New Lower Bound on the Potential-Ramsey Number of Two Graphs
    Jin-zhi Du
    Jian-hua Yin
    [J]. Acta Mathematicae Applicatae Sinica, English Series, 2021, 37 : 176 - 182
  • [42] Improved lower bound for the list chromatic number of graphs with no Kt minor
    Steiner, Raphael
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2022, 31 (06): : 1070 - 1075
  • [43] A New Lower Bound on the Potential-Ramsey Number of Two Graphs
    Jin-zhi DU
    Jian-hua YIN
    [J]. Acta Mathematicae Applicatae Sinica, 2021, 37 (01) : 176 - 182
  • [44] A tight lower bound on the matching number of graphs via Laplacian eigenvalues
    Gu, Xiaofeng
    Liu, Muhuo
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2022, 101
  • [45] A New Lower Bound on the Potential-Ramsey Number of Two Graphs
    Du, Jin-zhi
    Yin, Jian-hua
    [J]. ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2021, 37 (01): : 176 - 182
  • [46] A lower bound on the number of removable ears of 1-extendable graphs
    Zhai, Shaohui
    Lucchesi, Claudio L.
    Guo, Xiaofeng
    [J]. DISCRETE MATHEMATICS, 2010, 310 (05) : 1123 - 1126
  • [47] THE LOWER BOUND FOR THE NUMBER OF 1-FACTORS IN GENERALIZED PETERSEN GRAPHS
    Ren, H.
    Yang, C.
    Wang, J.
    [J]. BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2017, 43 (06) : 1925 - 1937
  • [48] A lower bound for the number of orientable triangular embeddings of some complete graphs
    Grannell, M. J.
    Knor, M.
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2010, 100 (02) : 216 - 225
  • [49] Brushing Number and Zero-Forcing Number of Graphs and Their Line Graphs
    Erzurumluoglu, Aras
    Meagher, Karen
    Pike, David
    [J]. GRAPHS AND COMBINATORICS, 2018, 34 (06) : 1279 - 1294
  • [50] Brushing Number and Zero-Forcing Number of Graphs and Their Line Graphs
    Aras Erzurumluoğlu
    Karen Meagher
    David Pike
    [J]. Graphs and Combinatorics, 2018, 34 : 1279 - 1294
12345