Some Results on Total Coloring and List Total Coloring of Graphs
Wu Jian · 2002
In the paper, it is proved that a connected graph G has the total chromatic number and the list total chromatic number Δ+1 if there is a spanning tree T of G such that Δ(G)≥6 and Δ(G\E(T))≤2 ,or Δ(G)≥4 and Δ(G\E(T))≤1 .