A new lower bound on the order of a critical edge-chromatic graph with given small girth

被引：0
|
作者：
Haile, D [1 ]
机构：
[1] SO ILLINOIS UNIV,DEPT MATH,CARBONDALE,IL 62901
来源：
UTILITAS MATHEMATICA | 1996年 / 49卷
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A graph is of class 2 if its edge-chromatic index is greater than its maximum degree. A class 2 graph G is critical edge-chromatic if the removal of any edge reduces its chromatic index. f(k,g) represents the minimum possible number of vertices in a critical graph of maximum degree k and girth g. We shall prove that 23 less than or equal to f(3, 7) less than or equal to 25.
引用
收藏
页码：97 / 152
页数：56
相关论文
共 50 条
  • [31] A lower bound of the surviving rate of a planar graph with girth at least seven
    Weifan Wang
    Stephen Finbow
    Ping Wang
    Journal of Combinatorial Optimization, 2014, 27 : 621 - 642
  • [32] A lower bound of the surviving rate of a planar graph with girth at least seven
    Wang, Weifan
    Finbow, Stephen
    Wang, Ping
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (04) : 621 - 642
  • [33] A new bound on the acyclic edge chromatic number
    Fialho, Paula M. S.
    de Lima, Bernardo N. B.
    Procacci, Aldo
    DISCRETE MATHEMATICS, 2020, 343 (11)
  • [34] A bound on the size of a graph with given order and bondage number
    Hartnell, BL
    Rall, DF
    DISCRETE MATHEMATICS, 1999, 197 (1-3) : 409 - 413
  • [35] A LOWER BOUND FOR RADIO k-CHROMATIC NUMBER OF AN ARBITRARY GRAPH
    Kola, Srinivasa Rao
    Panigrahi, Pratima
    CONTRIBUTIONS TO DISCRETE MATHEMATICS, 2015, 10 (02) : 45 - 57
  • [36] A new lower bound on graph gonality
    Harp, Michael
    Jackson, Elijah
    Jensen, David
    Speeter, Noah
    DISCRETE APPLIED MATHEMATICS, 2022, 309 : 172 - 179
  • [37] A new lower bound for the chromatic number of the rational space
    Ponomarenko, E. I.
    Raigorodskii, A. M.
    RUSSIAN MATHEMATICAL SURVEYS, 2013, 68 (05) : 960 - 962
  • [38] An Upper Bound for the Adjacent Vertex Distinguishing Acyclic Edge Chromatic Number of a Graph
    Xin-sheng Liu~1 Ming-qiang An~2 Yang Gao~1 1 College of Mathematics and Information Science
    Acta Mathematicae Applicatae Sinica, 2009, 25 (01) : 137 - 140
  • [39] An Upper Bound for the Adjacent Vertex Distinguishing Acyclic Edge Chromatic Number of a Graph
    Liu, Xin-sheng
    An, Ming-qiang
    Gao, Yang
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2009, 25 (01): : 137 - 140
  • [40] An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph
    Xin-sheng Liu
    Ming-qiang An
    Yang Gao
    Acta Mathematicae Applicatae Sinica, English Series, 2009, 25 : 137 - 140
12345