Total Coloring of Wheels
Yang Peng-hui · Hainan Daxue xuebao. Ziran kexue ban · 2011
The total chromatic number χT(H) of hypergraph H is the minimum number of colors needed to color the vertices and edges of H so that the incident or adjacent elements have distinct colors.The total coloring of hypergraph contains weak total coloring and strong total coloring.In the paper,the characteristics of the total colorings of wheel W(v) were discussed,and the chromatic numbers of them,χWT(W(v))=Δ+1,χST(W(v))= M+1 were obtained.