共 50 条
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
关键词:
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
相关论文