关于图的全染色和列表全染色方面的一些结果

Some Results on Total Coloring and List Total Coloring of Graphs

证明了如下结果 :一个简单连通图G的全色数和列表全色数都为Δ + 1,如果它存在一个支撑子树T使得Δ(G)≥ 6和Δ(G \E(T) )≤ 2 ,或者Δ(G)≥ 4和Δ(G \E(T) )≤

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 .