论文信息 - Equitable Total Coloring of Graphs with Maximum Degree 3

Equitable Total Coloring of Graphs with Maximum Degree 3

Abstract. The equitable total chromatic number χrdquo;e(G) of a graph G is the smallest integer k for which G has a total k-coloring such that the number of vertices and edges in any two color classes differ by at most one. We prove in this paper that χrdquo;e(G)≤5 if G is a multigraph with maximum degree at most 3.

Wei-Fan Wang

[1] V. G. Vizing. SOME UNSOLVED PROBLEMS IN GRAPH THEORY , 1968 .

[2] Uppaluri S. R. Murty,et al. Graph Theory with Applications , 1978 .

[3] Ko-Wei Lih,et al. On equitable coloring of bipartite graphs , 1996, Discret. Math..

[4] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[5] M. Rosenfeld,et al. On the total coloring of certain graphs , 1971 .

[6] Ko-Wei Lih,et al. Equitable Coloring and the Maximum Degree , 1994, Eur. J. Comb..

[7] D. de Werra. Equitable colorations of graphs , 1971 .

[8] Ko-Wei Lih,et al. Equitable Coloring of Trees , 1994, J. Comb. Theory, Ser. B.

[9] N. Vijayaditya. On Total Chromatic Number of a Graph , 1971 .