Abstract
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.
Access this article
Rent this article via DeepDyve
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00373-018-1876-x/MediaObjects/373_2018_1876_Fig1_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00373-018-1876-x/MediaObjects/373_2018_1876_Fig2_HTML.gif)
Similar content being viewed by others
References
Behzad, M.: Graphs and Their Chromatic Numbers, Doctoral Thesis. Michigan State University, East Lansing (1965)
Behzad, M.: The Total Chromatic Number, Combinatorial Mathematics and Its Applications, Proc, Conf., Oxford 1969, pp. 1–8. Academic Press, London (1971)
Campos, C.N., de Mello, C.P.: The total chromatic number of some bipartite graphs. Electron. Notes Discret. Math. 22, 551–561 (2005)
Hammack, R., Imrich, W., Klavžar, S.: Handbook of Product Graphs. CRC Press, Taylor and Francis Group, Boca Raton (2011)
Kemnitz, A., Marangio, M.: Total colorings of Cartesian products of graphs. Congr. Numer. 165, 99–109 (2003)
McDiarmid, C.J.H., Sánchez-Arroyo, A.: Total coloring regular bipartite graphs is NP-hard. Discret. Math. 124, 155–162 (1994)
Pranavar, K., Zmazek, B.: On total chromatic number of direct product graphs. J. Appl. Math. Comput. 33(1–2), 449–457 (2010)
Sabidussi, G.: Graph multiplication. Math. Z. 72(1), 446–457 (1960)
Seoud, M.A.: Total chromatic numbers. Appl. Math. Lett. 5(6), 37–39 (1992)
Seoud, M.A.: Total colourings of Cartesian products. Int. J. Math. Educ. Sci. Technol. 28(4), 481–487 (1997)
Tong, C., Xiaohui, L., Yuanshenga, Y., Zhihe, L.: Equitable total coloring of \(C_{n}\square C_m\). Discret. Appl. Math. 157, 596–601 (2009)
Vizing, V.G.: The Cartesian product of graphs. Vyc. Sis. 9, 30–43 (1963)
Vizing, V.G.: Some unsolved problems in graph theory (in Russian). Uspekhi Matematicheskikh Nauk 23, 117–134 [English translation in Russian Mathematical Surveys 23, 125–141 (1968)]
Yap, H.P.: Total Colourings of Graphs. Springer, Berlin (1996)
Zmazek, B., Žerovnik, J.: Behzad–Vizing conjecture and Cartesian-product graphs. Appl. Math. Lett. 15(6), 781–784 (2002)
Acknowledgements
We are grateful to the reviewers for their valuable and helpful comments which lead to the improvement of this paper. This work was supported by SERB (No. SB/S4/MS:867/14).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Geetha, J., Somasundaram, K. Total Colorings of Product Graphs. Graphs and Combinatorics 34, 339–347 (2018). https://doi.org/10.1007/s00373-018-1876-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-018-1876-x