| 边染色9-临界图边数的新下界 |
| |
| 引用本文： | 李梅,田大东. 边染色9-临界图边数的新下界[J]. 黑龙江科技学院学报, 2010, 20(5): 406-410 |
| |
| 作者姓名： | 李梅 田大东 |
| |
| 作者单位： | 中国矿业大学理学院,江苏徐州221116 |
| |
| 摘 要： | 针对Vizirtg猜想△为9的情况,运用Discharging差值转移方法研究了9-临界图的边数下界,得到了新结论：m≥10^-36n,改进了已有结果。
|
| 关 键 词： | 临界图 边数 下界 度 |
New lower bound for size of edge chromatic critical graphs with maximum degree 9 |
| |
| LI Mei,TIAN Dadong. New lower bound for size of edge chromatic critical graphs with maximum degree 9[J]. Journal of Heilongjiang Institute of Science and Technology, 2010, 20(5): 406-410 |
| |
| Authors: | LI Mei TIAN Dadong |
| |
| Affiliation: | ( College of Sciences, China University of Mining ＆ Technology, Xuzhou 221116, China) |
| |
| Abstract: | For the case of Vizing-proposed conjecture with △= 9, this paper discusses the lower bound about the edge chromatic critical graphs by applying a discharging method. It gives the new result m≥10^-36n,which improves the known bounds. |
| |
| Keywords: | critical graphs size of edge lower size degrees |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
