摘要
In this study,using the method of contradiction and the pre-assignment of chromatic sets,we discuss the E-total coloring of complete bipartite graphs K_(5,n)(5≤n≤7 113) which are vertex-distinguished by multiple sets.The vertex-distinguishing E-total chromatic numbers of this kind of graph are determined.
本文利用反证法和色集合事先分配法,探讨了完全二部图K_(5,n)(5≤n≤7 113)的点被多重集可区别的E-全染色,确定了这类图的点被多重集可区别的E-全色数。
基金
Supported by the National Natural Science Foundation of China (11761064)。
