An upper bound for the adjacent vertex-distinguishing VI-total chromatic number of graphs
Xinsheng Liu · Journal of Lanzhou University · 2011
According to the definition of the adjacent vertex-distinguishing Ⅵ-total coloring of graphs, the upper bound for the adjacent vertex-distinguishing Ⅵ-total chromatic number by the probability method was studied. If δ 150 √ ln , then χ vi at (G) (G) + 1 + 2 √ ln , where δ is the minimum degree of G and is the maximum degree of G.