Journal of Jilin University Science Edition ›› 2020, Vol. 58 ›› Issue (4): 832-840.
Previous Articles Next Articles
YANG Jiarui, CHEN Xiang’en
Received:
Online:
Published:
Contact:
Abstract: Firstly, we discussed vertex-distinguishing general total chromatic number of complete tripartite graphs K3,5,p(p≥5) by using the method of distributing the color sets in advance and contradiction, and gave special proofs when p was small and regular proofs when p increased gradually. Secondly, we used the methods of constructing the colorings to dye the complete tripartite graphs K3,5,p, and gave a coloring scheme. The success of the coloring verified the correctness of the color number proved by the contradiction method, thus we solved the problem of vertex-distinguishing general total coloring of complete tripartite graphs K3,5,p.
Key words: complete tripartite graph, general total coloring, vertex-distinguishing , general total coloring, vertexdistinguishing general total chromatic number
CLC Number:
YANG Jiarui, CHEN Xiang’en. Vertex-Distinguishing General Total Coloring of K3,5,p[J].Journal of Jilin University Science Edition, 2020, 58(4): 832-840.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: http://xuebao.jlu.edu.cn/lxb/EN/
http://xuebao.jlu.edu.cn/lxb/EN/Y2020/V58/I4/832
Cited