• 제목/요약/키워드: The equitable total coloring

검색결과 1건 처리시간 0.016초

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

  • Wang, Haiying;Wei, Jianxin
    • Journal of applied mathematics & informatics
    • /
    • 제24권1_2호
    • /
    • pp.313-323
    • /
    • 2007

  • 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.