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

E-Total Coloring of Complete Bipartite Graphs K_(4,n)Which Are Vertex-Distinguished by Multiple Sets

作　　者：郭亚勤 陈祥恩 GUO Yaqin;CHEN Xiang’en(College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,China)

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

出　　处：《吉林大学学报（理学版）》2024年第3期480-486,共7页Journal of Jilin University:Science Edition

基　　金：国家自然科学基金(批准号:11761064).

摘　　要：利用反证法、色集合事先分配法及构造具体染色等方法,讨论完全二部图K_(4,n)的点被多重集可区别的E-全染色,并确定K_(4,n)的点被多重集可区别的E-全色数.We discussed the E-total coloring of complete bipartite graphs K_(4,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 K_(4,n)which were vertex-distinguished by multiple sets.

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

分 类 号：O157.5[理学—数学]