Equitable Total Coloring of Graphs with Maximum Degree 3 |
| |
Authors: | Wei-Fan Wang |
| |
Affiliation: | (1) Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang 321004, China e-mail: wwf@lnu.edu.cn, CN |
| |
Abstract: | The equitable total chromatic number χr d q u o; 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 χr d q u o; e (G)≤5 if G is a multigraph with maximum degree at most 3. Received: February 24, 2000 Final version received: February 2, 2001 Acknowledgments. The author would like to thank the referee for valuable suggestions to improve this work. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|