吉林大学学报(理学版) ›› 2024, Vol. 62 ›› Issue (3): 480-486.

• • 上一篇    下一篇

完全二部图K4,n的点被多重集可区别的E-全染色

郭亚勤, 陈祥恩   

  1. 西北师范大学 数学与统计学院, 兰州 730070
  • 收稿日期:2023-10-07 出版日期:2024-05-26 发布日期:2024-05-26
  • 通讯作者: 陈祥恩 E-mail:chenxe@nwnu.edu.cn

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

摘要: 利用反证法、 色集合事先分配法及构造具体染色等方法, 讨论完全二部图K4,n的点被多重集可区别的E全染色, 并确定K4,n的点被多重集可区别的E-全色数.

关键词: 完全二部图, E-全染色, E-全色数, 多重集, 色集合

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

中图分类号: 

  • O157.5