Total Coloring of Wheels

YANG Peng-hui. Total Coloring of WheelsJ. Natural Science of Hainan University, 2011, 29(1): 8-10,19. DOI: 10.15886/j.cnki.hdxbzkb.2011.01.016

Citation:

YANG Peng-hui. Total Coloring of WheelsJ. Natural Science of Hainan University, 2011, 29(1): 8-10,19. DOI: 10.15886/j.cnki.hdxbzkb.2011.01.016

Citation:

YANG Peng-hui. Total Coloring of WheelsJ. Natural Science of Hainan University, 2011, 29(1): 8-10,19. DOI: 10.15886/j.cnki.hdxbzkb.2011.01.016

Abstract

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, χ_T^W(W(v))=Δ+1, χ_T^S(W(v))=M+1. were obtained.

FullText(HTML)

Turn off MathJax

Article Contents

Export File