摘要
利用色集事先分配法,构造染色法、反证法、组合分析法探讨了完全三部图K_(4,4,p)的最优点可区别一般全染色问题,确定了K_(4,4,p)的点可区别一般全色数。
The optimal vertex-distinguishing general total coloring of complete tripartite graph K_(4,4,p) is discussed by using of the methods of distributing the color sets in advance,constructing the colorings,contradiction and combinatorial analysis.The vertex-distinguishing general total chromatic number of K_(4,4,p) is determined.
作者
马静静
陈祥恩
MA Jing-jing;CHEN Xiang-en(College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,Gansu,China)
出处
《山东大学学报(理学版)》
CAS
CSCD
北大核心
2022年第4期48-54,共7页
Journal of Shandong University(Natural Science)
基金
国家自然科学基金资助项目(11761064)。
关键词
完全三部图
一般全染色
点可区别一般全染色
点可区别一般全色数
complete tripartite graph
general total coloring
vertex-distinguishing general total coloring
vertex-distinguishing general total chromatic number