摘要
关于Vizing边染色临界图边数下界的猜想,到目前为止,Δ≤5的情况已经得到证明,在传统Fiorini不等式方法证明边染色临界图下界的基础上,借鉴了文献[1]的思想,得到了新的关于最大度是9和10的边染色临界图的下界:Δ=9时,m≥33/10n;Δ=10时,m≥43/12n。
The paper introduces Vizing-proposed conjecture about the lower bounds for edge chromatic critical graphs and highlights the verification of this conjecture for △≤5, In this paper, both the Fiorini method and the new method in [1] , led us to new results for the maximum degrees of 9 and 10;m≥33/10n when △=9,and m≥43/12nwhen △=10.
出处
《黑龙江科技学院学报》
CAS
2007年第6期479-482,共4页
Journal of Heilongjiang Institute of Science and Technology
关键词
临界图
下界
染色
度
critical graphs
lower bound
edge chromatic
degrees
