完全二部图K_5,n(n ≥ 7114)的点被多重集可区别的E-全染色  

E-Total Coloring of Complete Bipartite Graphs K5,n(n ≥ 7114) Which Are Vertex-Distinguished by Multiple Sets

作　　者：郭亚勤 

机构地区：[1]西北师范大学数学与统计学院,甘肃兰州

出　　处：《理论数学》2024年第7期163-172,共10页Pure Mathematics

摘　　要：利用反证法、色集合事先分配法以及构造具体染色等方法,探讨了完全二部图K5,n(n ≥ 7114)的点被多重集可区别的E-全染色,确定了这一类图的点被多重集可区别的E-全色数。In this paper, the E-total coloring of complete bipartite graphs K5,n(n ≥ 7114) which are vertex-distinguished by multiple sets is discussed by using the method of contradiction, the method of pre-assignment of chromatic sets and the method of constructing specific coloring, we determined E-total chromatic numbers of K5;n which are vertex-distinguished by multiple sets.

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

分 类 号：O15[理学—数学]