Vertex-distinguishing IE-total coloring and general-total coloring of K1,5,p and K1,6,p
KOU Yanfang1, CHEN Xiangen1, WANG Zhiwen2
1. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China;
2. School of Mathematics and Statistics, Ningxia University, Yinchuan 750021, China
Abstract：By employing the methods of distributing the color sets in advance and constructing the colorings and contradiction, we discuss the vertex-distinguishing IE-total coloring and vertex-distinguishing general total coloring of complete tripartite graphs K1,5,p and K1,6,p. The vertex-distinguishing IE-total chromatic number and vertex-distinguishing general total chromatic number of K1,5,p and K1,6,p are determined.
[1] HARARY F, PLANTHOLT M. The point-distinguishing chromatic index[C]//HARARY F, MAY-BEE J S.Graphs and Application. New York:Wiley Interscience, 1985:147-162.
[2] HORÁK M, SOTÁK R. The fifth jump of the point-distinguishing chromatic index of Kn,n[J]. Ars Combinatoria,1996, 42:233-242.
[3] HORÁK M, SOTÁK R. Localization jumps of the point-distinguishing chromatic index of Kn,n[J]. Discuss Math Graph Theory, 1997, 17:243-251.
[4] HORÁK M, ZAGAGLIA S N. On the point-distinguishing chromatic index of Km,n[J]. Ars Combinatoria, 2006, 80:75-85.
[5] ZAGAGLIA SALVI N. On the value of the point-distinguishing chromatic index of Kn,n[J]. Ars Combinatoria, 1990, 29(B):235-244.
[6] CHEN X E. Point-distinguishing chromatic index of the union of paths[J]. Czechoslovak Mathematical Journal, 2014, 64(3):620-640.
[7] CHEN X E, GAO Y P, YAO B. Vertex -distinguishing IE-total colorings of complete bipartite graphs Km,n (m < n)[J]. Discussiones Mathematicae Graph Theory, 2013, 33:289-306.
[8] LIU C J, ZHU E Q. General vertex-distinguishing total coloring of graphs[J]. Journal of Applied Mathematics, 2014, Article ID 849748.
2018, Vol. 45 
