Total Colorings of Product Graphs

被引：0
作者：
J. Geetha
K. Somasundaram
机构：
[1] Amrita School of Engineering-Coimbatore,Department of Mathematics
来源：
Graphs and Combinatorics | 2018年 / 34卷
关键词：
Product graphs; Direct product; Strong product; Lexicographic product; Total coloring;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A total coloring of a graph is an assignment of colors to all the elements of the graph in such a way that no two adjacent or incident elements receive the same color. In this paper, we prove Behzad–Vizing conjecture for product graphs. In particular, we obtain the tight bound for certain classes of graphs.
引用
收藏
页码：339 / 347
页数：8
相关论文
共 18 条
[1]  
Campos CN(2005)The total chromatic number of some bipartite graphs Electron. Notes Discret. Math. 22 551-561
[2]  
de Mello CP(2003)Total colorings of Cartesian products of graphs Congr. Numer. 165 99-109
[3]  
Kemnitz A(1994)Total coloring regular bipartite graphs is NP-hard Discret. Math. 124 155-162
[4]  
Marangio M(2010)On total chromatic number of direct product graphs J. Appl. Math. Comput. 33 449-457
[5]  
McDiarmid CJH(1960)Graph multiplication Math. Z. 72 446-457
[6]  
Sánchez-Arroyo A(1992)Total chromatic numbers Appl. Math. Lett. 5 37-39
[7]  
Pranavar K(1997)Total colourings of Cartesian products Int. J. Math. Educ. Sci. Technol. 28 481-487
[8]  
Zmazek B(2009)Equitable total coloring of Discret. Appl. Math. 157 596-601
[9]  
Sabidussi G(1963)The Cartesian product of graphs Vyc. Sis. 9 30-43
[10]  
Seoud MA(2002)Behzad–Vizing conjecture and Cartesian-product graphs Appl. Math. Lett. 15 781-784
12