Hits:

Indexed by:期刊论文

Date of Publication:2009-02-28

Journal:DISCRETE APPLIED MATHEMATICS

Included Journals:SCIE

Volume:157

Issue:4

Page Number:596-601

ISSN No.:0166-218X

Key Words:Total coloring; Equitable total coloring; Equitable total chromatic number; Cycle; Cartesian product

Abstract: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.