点击次数：

论文类型：期刊论文

发表时间：2009-02-28

发表刊物：DISCRETE APPLIED MATHEMATICS

收录刊物：SCIE

卷号：157

期号：4

页面范围：596-601

ISSN号：0166-218X

关键字：Total coloring; Equitable total coloring; Equitable total chromatic number; Cycle; Cartesian product

摘要：The equitable total chromatic number of a graph G is the smallest integer k for which G has a k-total coloring such that the number of vertices and edges colored with each color differs by at most one. In this paper, we show that the Cartesian product graphs of C-m and C-n have equitable total 5-coloring for all in >= 3 and n >= 3. (C) 2008 Elsevier B.V. All rights reserved.