本文研究了图的2-强边色数的上界.利用图染色的概率方法中的一般局部引理,得到了3≤△≤730时,x's(G,2)≤2△+1,推广了参考文献[11,12]中的结果
In this paper, we study the upper bound for the the r-strong edge chromatic number of regular graph. By probability method, we prove that if 3≤△≤730, then x's(G,2)≤2△+1 by the general local lemma, which extends some corresponding results in [11, 12].