In this paper,we use the method of contradiction,constructing concrete coloring and distributing the color sets in advance,discuss the general total colorings of complete 3-partite graph which are vertex-distinguished by multisets.Torresponding optimal colo-ring and the chromatic numbers of the corresponding colorings are obtained.
complete 3-partite graphgeneral total coloringmultisetcolor setdistinguishing
NETL
NSTL
万方数据
