完全六部图的点被多重集可区别的一般全染色(n₁≤n₂ < n₃ < n₄ < n₅ < n₆)

General Total Coloringsof a Complete 6-Partite Graph WhichAre Vertex-Distinguishing by Multisets (n₁≤n₂ < n₃ < n₄ < n₅ < n₆)

文章利用反证法、 预先分配颜色集合的方法和构造染色法,探讨了完全六部图的顶点被多重集可区别的一般全染色,找出了最优染色方案并确定了对应的染色的色数。

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 complete6-partite graph which are vertex-distinguished by multisets, give the optimal coloringscheme and determine the chormatic numbers of the corresponding colorings.