Hits :

First Author : Wei-Fan Wang

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2002-01-01

Document Type : 期刊

Journal : Graphs and Combinatorics

Volume: Vol.18

Issue : NO.3

Page Number : 677-685

ISSN : 0911-0119

Translation or Not : no

Abstract : The equitable total chromatic number chi 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 chi r