The adjacent vertex distinguishing total chromatic number is obtained for the flower graph.
得到了花图的邻点可区别全色数。
In this paper the total chromatic conjecture is verified to be true for complete 4-partite graph.
本文对所有4部完全图证实了全着色猜想。
The adjacent vertex distinguishing total chromatic number is obtained for the middle graphs of path, cycle, star and fan graph.
本文考虑了图的中间图的邻点可区别全色数，并确定了路、圈、星图和扇图的中间图的邻点可区别全色数。
应用推荐