Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

THE EQUITABLE TOTAL CHROMATIC NUMBER OF THE GRAPH $HM(W_n)$

  • Wang, Haiying (Department of Mathematics, Beijing Institute of Technology) ;
  • Wei, Jianxin (School of Mathematics and Information, Yantai Normal University)
  • Published : 2007.05.31

⟨ Previous Next ⟩

Abstract

The equitable total chromatic number ${\chi}_{et}(G)$ of a graph G is the smallest integer ${\kappa}$ for which G has a total ${\kappa}$-coloring such that the number of vertices and edges in any two color classes differ by at most one. In this paper, we determine the equitable total chromatic number of one class of the graphs.

Keywords