A study of the total chromatic number of equibipartite graphs

The total chromatic number zt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same color, no incident edges receive the same color as either of the vertices it is incident with. In this paper, we obtain some results of the total chromatic number of the equibipartite graphs of order 2n with

• Type: Journal
• Year: 1998
• Where: DM
• Authors: Bor-Liang Chen, Chun-Kan Cheng, Hung-Lin Fu, Kuo-Ching Huang
• Keywords: Adjacent Vertices, Color, DM 1998, Total Chromatic Number