完全六部图的点被多重集可区别的一般全染色(n1≤n2 < n3 < n4 < n5 < n6)
General Total Coloringsof a Complete 6-Partite Graph WhichAre Vertex-Distinguishing by Multisets (n1≤n2 < n3 < n4 < n5 < n6)
摘要: 文章利用反证法、 预先分配颜色集合的方法和构造染色法，探讨了完全六部图的顶点被多重集可
区别的一般全染色，找出了最优染色方案并确定了对应的染色的色数。
Abstract:
y using the method of contradiction, the color sets pre-distribution method and con-
structing the coloring method, we discussed the general total colorings of a complete
6-partite graph which are vertex-distinguished by multisets, give the optimal coloring
scheme and determine the chormatic numbers of the corresponding colorings.
参考文献
|
[1]
|
Harary, F. and Plantholt, M. (1985) The Point-Distinguishing Chromatic Index. In: Graphs
and Application, Wiley Interscience, 147-162.
|
|
[2]
|
Liu, C.J. and Zhu, E.Q. (2014) General Vertex-Distinguishing Total Coloring of Graphs. Jour-
nal of Applied Mathematics, 2014, Article ID: 849748. [Google Scholar] [CrossRef]
|
|
[3]
|
陈祥恩, 张爽, 李泽鹏. K2,4,p的点可区别IE-全染色[J]. 电子与信息学报, 2020, 42(12): 2999-
3004.
|
|
[4]
|
陈祥恩, 王勇军. 完全二部图的点被多重集可区别的IE-全染色及一般全染色[J]. 吉林大学学
报(理学版), 2022, 60(4): 838-844.
|
|
[5]
|
王勇军, 陈祥恩. 完全四部图的点被多重集可区别的一般全染色(n1≤n2 =n3 < n4 或n1=n2=
n3=n4) [J]. 吉林大学学报(理学版), 2023, 61(5): 1037-1041.
|
|
[6]
|
邵嘉裕. 组合数学[M]. 上海: 同济大学出版社, 1990: 5-8.
|