Algorithm for the Vertex-Distinguishing Total Coloring of Complete Graph
A new algorithm whose name is algorithm of classified order coloring is proposed on the base of the characteristics of the vertex-distinguishing total coloring of complete graph in this paper. All of its elements are classified according to some rules and then are colored in proper sequence. Moreover, a relate-lock-table is presented to judge whether the results are correct. The experimental results show that the algorithm can effectively solve the vertex-distinguishing total coloring of complete graph.
Unable to display preview. Download preview PDF.
- 6.Zhang, Z.-F., Li, J.-W., Chen, X.-E., et al.: D(β)-vertex-distinguishing proper edge coloring of graphs. Acta Mathematica Sinica 49(3), 703–708 (2006)Google Scholar
- 7.Zhang, Z.-F., Li, J.-W., Chen, X.-E., et al.: D(β)-vertex-distinguishing proper total coloring of graphs. Sci. China 49(10), 1430–1440 (2006)Google Scholar
- 8.Bondy, J.A., Marty, U.S.R.: Graph theory with application. The Macmillan Press Ltd., New York (1976)Google Scholar