Equitable total coloring of Cm □ Cn

被引：8
作者：
Tong Chunling [1 ,2 ]
Lin Xiaohui [1 ]
Yang Yuansheng [1 ]
Li Zhihe [1 ]
机构：
[1] Dalian Univ Technol, Dept Comp Sci & Engn, Dalian 116024, Peoples R China
[2] Shandong Jiaotong Univ, Dept Informat Sci & Engn, Jinan 250023, Peoples R China
来源：
DISCRETE APPLIED MATHEMATICS | 2009年 / 157卷 / 04期
关键词：
Total coloring; Equitable total coloring; Equitable total chromatic number; Cycle; Cartesian product; TOTAL CHROMATIC NUMBER; GRAPHS;
D O I：
10.1016/j.dam.2008.08.030
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：596 / 601
页数：6
相关论文
共 22 条
[1]  
Baril JL, 2006, AUSTRALAS J COMB, V35, P89
[2]  
Behzad M., 1965, Doctoral thesis
[3]   A result on the total colouring of powers of cycles [J].
Campos, C. N. ;
de Mello, C. P. .
DISCRETE APPLIED MATHEMATICS, 2007, 155 (05) :585-597
[4]   On the neighbour-distinguishing index of a graph [J].
Edwards, Keith ;
Hornak, Mirko ;
Wozniak, Mariusz .
GRAPHS AND COMBINATORICS, 2006, 22 (03) :341-350
[5]  
FU HL, 1994, CONGER NUMER, V102, P111
[6]  
Hilton A. J. W., 2003, AUSTRALAS J COMB, V28, P93
[7]  
Kemnitz A., 2003, Congr. Numer., V165, P99
[8]   TOTAL COLORING OF A MULTI-GRAPH WITH MAXIMAL DEGREE-4 [J].
KOSTOCHKA, AV .
DISCRETE MATHEMATICS, 1977, 17 (02) :161-163
[9]   Total chromatic number of one kind of join graphs [J].
Li, Guangrong ;
Zhang, Limin .
DISCRETE MATHEMATICS, 2006, 306 (16) :1895-1905
[10]   TOTAL COLORING REGULAR BIPARTITE GRAPHS IS NP-HARD [J].
MCDIARMID, CJH ;
SANCHEZARROYO, A .
DISCRETE MATHEMATICS, 1994, 124 (1-3) :155-162
123