Upper Bounds on the D(β)-Vertex-Distinguishing Total-Chromatic Number of Graphs

作者：Liu Xin-sheng^*; Zhu Zhi-qiang

来源：Ars Combinatoria, 2015, 119: 403-411.

• random coloring
• probability method
• positive probability
• D(beta)-vertex-distinguishing total-chromatic number

In this paper, we study the upper bounds for the D(beta)-vertex-distinguishing totalchromatic numbers by probability method, and obtain: Let A be the maximum degree of G, then @@@ chi beta vt(G) <= {16 Delta((beta+1)/(2 Delta+2)), Delta >= 3, beta >= 4 Delta +3; @@@ 13 Delta((beta+4)/4), Delta >= 4, beta >= 5; @@@ 10 Delta(2), Delta >= 3, 2 <= beta <= 4.

• 出版日期2015-1
• 单位西北师范大学