图的D(β)-点可区别边色数的上界

An Upper Bound on the D(β)-vertex-distinguishing Edge Chromatic Number of Graphs

用概率方法中的Lovasz局部引理得到了距离不超过β的图的点可区别边色数的上界,即对任意最大度不小于2的简单图都有χ'β-vde(G)≤32d(d-1)β-1.

It＇s shown that the upper bound of D（ β）-vertex-distinguishing edge chromatic number is at most 32 d（ d-1）β-1 by using Lovasz local lemma in probability method, for any graph with Δ ≥2.