论文部分内容阅读
The total chromatic number χt(G) of a graph G(V,E) is the minimum number of total independent partition sets of V E, satisfying that any two sets have no common element. If the difference of the numbers of any two total independent partition sets of V E i