Journal of Jilin University Science Edition ›› 2024, Vol. 62 ›› Issue (3): 480-486.

Previous Articles     Next Articles

E-Total Coloring of Complete Bipartite Graphs K4,n Which Are Vertex-Distinguished by Multiple Sets

GUO Yaqin, CHEN Xiang’en   

  1. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China
  • Received:2023-10-07 Online:2024-05-26 Published:2024-05-26

Abstract: We discussed the E-total coloring of complete bipartite graphs K4,n which were vertex-distinguished by multiple sets by using
 the method of proof by contradiction, the method of pre-assignment of color sets and the method of constructing specific coloring, and determined E-total chromatic numbers of K4,n which were vertex-distinguished by multiple sets.

Key words: complete bipartite graph, E-total coloring, E-total chromatic number, multiple set, color set

CLC Number: 

  • O157.5