A new lower bound on critical graphs with maximum degree of 8 and 9

被引：0
|
作者：
Li, Xuechao [1 ]
机构：
[1] Univ Georgia, Div Acad Enhancement, Athens, GA 30602 USA
来源：
ARS COMBINATORIA | 2011年 / 98卷
关键词：
edge chromatic number; critical graph; CHROMATIC CRITICAL GRAPHS; INDEX-CRITICAL GRAPHS; AVERAGE DEGREE; SIZE; SURFACE;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this article, we give new lower bounds for the size of edge chromatic critical graphs with maximum degrees of 8, 9 respectively. Furthermore, it implies that if G is a graph embeddable in a surface S with characteristics c(S) = 1 or 2, then G is class one if maximum degree Delta >= 8 or 9 respectively.
引用
收藏
页码：241 / 257
页数：17
相关论文
共 50 条
  • [1] On the size of critical graphs with maximum degree 8
    Miao Lianying
    Sun Qingbo
    [J]. DISCRETE MATHEMATICS, 2010, 310 (15-16) : 2215 - 2218
  • [2] A LOWER BOUND ON THE k-CONVERSION NUMBER OF GRAPHS OF MAXIMUM DEGREE k
    Mynhardt, Christina M.
    Wodlinger, Jane L.
    [J]. TRANSACTIONS ON COMBINATORICS, 2019, 8 (03) : 1 - 12
  • [3] The New Lower Bound of the Number of Vertices of Degree 5 in Contraction Critical 5-Connected Graphs
    Tingting Li
    Jianji Su
    [J]. Graphs and Combinatorics, 2010, 26 : 395 - 406
  • [4] The New Lower Bound of the Number of Vertices of Degree 5 in Contraction Critical 5-Connected Graphs
    Li, Tingting
    Su, Jianji
    [J]. GRAPHS AND COMBINATORICS, 2010, 26 (03) : 395 - 406
  • [5] A better lower bound on average degree of 4-list-critical graphs
    Rabern, Landon
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2016, 23 (03):
  • [6] On the average degree of critical graphs with maximum degree Six
    Miao, Lianying
    Qu, Jibin
    Sun, Qingbo
    [J]. DISCRETE MATHEMATICS, 2011, 311 (21) : 2574 - 2576
  • [7] Vertices of Degree 9 in Contraction Critical 8-Connected Graphs
    Yang, Yingqiu
    [J]. ARS COMBINATORIA, 2017, 131 : 107 - 122
  • [8] On the size of critical graphs with small maximum degree
    Miao, Lian-Ying
    Song, Wen-Yao
    Pang, Shi-You
    Miao, Zheng-Ke
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2014, 91 (10) : 2142 - 2151
  • [9] A better lower bound on the average degree of online k-list-critical graphs
    Rabern, Landon
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (01):
  • [10] An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
    Miao, LY
    Pang, SY
    Wu, JL
    [J]. DISCRETE MATHEMATICS, 2003, 271 (1-3) : 321 - 325
12345