| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419734 | Discrete Applied Mathematics | 2009 | 6 Pages |
Abstract
The equitable total chromatic number of a graph GG is the smallest integer kk for which GG has a kk-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 CmCm and CnCn have equitable total 5-coloring for all m≥3m≥3 and n≥3n≥3.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Chunling Tong, Lin Xiaohui, Yang Yuansheng, Li Zhihe,