全着色边临界图的一个注记

A Note on the Total-colourable Edge Critical Graph

研究了全着色边临界图的结构,证明了对于△≥5的全着色边临界图G(V,E),若u∈V(G),d(u)=3,uvi∈E(G)(i=1,2,3),则△-1≤d(vi)≤△.

We investigated construction of the total-colorable edge critical graph. If u∈V（G）,d（u）=3,uvi∈E（G）（i=1,2,3）, then △-1≤d（vi）≤△,where G is a total-colourable edge critical graph,△（G） is the maximum degree of G and △（G）≥5.