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 条
  • [1] A lower bound on cochromatic number for line graphs of a kind of graphs
    Xinsheng L.
    Xiang’en C.
    Lifeng O.
    [J]. Applied Mathematics-A Journal of Chinese Universities, 2006, 21 (3) : 357 - 360
  • [2] A Lower Bound for the Radio Number of Graphs
    Bantva, Devsi
    [J]. ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2019, 2019, 11394 : 161 - 173
  • [3] CHROMATIC NUMBER VERSUS COCHROMATIC NUMBER IN GRAPHS WITH BOUNDED CLIQUE NUMBER
    ERDOS, P
    GIMBEL, J
    STRAIGHT, HJ
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 1990, 11 (03) : 235 - 240
  • [4] Lower bound number of irreducible graphs on surfaces
    Liu, Y
    Liu, YP
    [J]. ACTA MATHEMATICA SCIENTIA, 1998, 18 (03) : 333 - 339
  • [5] A lower bound on the chromatic number of Mycielski graphs
    Caramia, M
    Dell'Olmo, P
    [J]. DISCRETE MATHEMATICS, 2001, 235 (1-3) : 79 - 86
  • [6] A new lower bound on the independence number of graphs
    Angel, Eric
    Campigotto, Romain
    Laforest, Christian
    [J]. DISCRETE APPLIED MATHEMATICS, 2013, 161 (06) : 847 - 852
  • [7] LOWER BOUND NUMBER OF IRREDUCIBLE GRAPHS ON SURMCES
    刘莹
    刘彦佩
    [J]. Acta Mathematica Scientia, 1998, (03) : 333 - 339
  • [8] A lower bound for the convexity number of some graphs
    Kim B.K.
    [J]. Journal of Applied Mathematics and Computing, 2004, 14 (1-2) : 185 - 191
  • [9] A lower bound on the multichromatic number of Kneser graphs
    Osztenyi, Jozsef
    [J]. ACTA SCIENTIARUM MATHEMATICARUM, 2008, 74 (1-2): : 289 - 296
  • [10] An upper bound for the chromatic number of line graphs
    King, A. D.
    Reed, B. A.
    Vetta, A.
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2007, 28 (08) : 2182 - 2187
12345