摘要
利用反证法、构造染色法和色集合事先分配法,讨论完全四部图K_(n_(1),n_(2),n_(3),n_(4))(n_(1)≤n_(2)=n_(3)<n_(4)或n_(1)=n_(2)=n_(3)=n_(4))的顶点被多重集可区别的一般全染色,给出一个最优染色方案,并确定相应染色的色数.
By using the method of contradiction,the method of constructing concrete coloring and distributing the color sets in advance,we discussed the general total colorings of complete 4-partite graph K_(n_(1),n_(2),n_(3),n_(4))(n_(1)≤n_(2)=n_(3)<n_(4) or n_(1)=n_(2)=n_(3)=n_(4))that were vertex-distinguished by multisets.We gave an optimal coloring scheme and determined the chromatic numbers of the corresponding colorings.
作者
王勇军
陈祥恩
WANG Yongjun;CHEN Xiang’en(College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,China)
出处
《吉林大学学报（理学版）》
CAS
北大核心
2023年第5期1037-1041,共5页
Journal of Jilin University:Science Edition
基金
国家自然科学基金(批准号:11761064).
关键词
完全四部图
一般全染色
多重集
色集合
可区别
complete 4-partite graph
general total coloring
multiset
color set
distinguishing
