Strong Vertex-distinguishing Total Coloring Algorithm of Complete Graph
Zhao Huanping, Ping Liu, Jingwen Li · Jisuanji gongcheng · 2012
According to the definition of strong vertex-distinguishing total coloring,this paper combines with the symmetry of complete graph,proposes a new strong vertex-distinguishing total coloring algorithm.The algorithm divides the filled colors into two parts: overcolor and propercolor.At the premise of getting the coloring number and the coloring frequency,it uses colored at first to enhance its convergence.Experimental results show that this algorithm has a lower time complexity.