等完全p-部图的点被多重集可区别的一般全染色  

General Total Colorings of Complete p-Partite GraphsWhich Are Vertex-Distinguished by Multiple Sets

作　　者：王萱 陈祥恩 WANG Xuan;CHEN Xiang’en(College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,China)

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

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

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

摘　　要：利用反证法、色集合事先分配法和构造染色法,讨论等完全p-部图的顶点被多重集可区别的一般全染色,给出最优染色方案,并确定相应染色的色数.By using the method of proof by contradiction,the method of pre-assignment of color sets and the method of constructing coloring,we discussed the general total coloring of complete p-partite graphs which were vertex-distinguished by multiple sets,gave the coloring scheme for optimal coloring and determined the chormatic numbers of the corresponding colorings.

关 键 词：等完全p-部图 一般全染色 多重集 色集合 可区别 

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