Graphs and Combinatorics

, Volume 34, Issue 2, pp 339–347 | Cite as

Total Colorings of Product Graphs

Original Paper
  • 77 Downloads

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.

Keywords

Product graphs Direct product Strong product Lexicographic product Total coloring 

Notes

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).

References

  1. 1.
    Behzad, M.: Graphs and Their Chromatic Numbers, Doctoral Thesis. Michigan State University, East Lansing (1965)Google Scholar
  2. 2.
    Behzad, M.: The Total Chromatic Number, Combinatorial Mathematics and Its Applications, Proc, Conf., Oxford 1969, pp. 1–8. Academic Press, London (1971)Google Scholar
  3. 3.
    Campos, C.N., de Mello, C.P.: The total chromatic number of some bipartite graphs. Electron. Notes Discret. Math. 22, 551–561 (2005)MATHGoogle Scholar
  4. 4.
    Hammack, R., Imrich, W., Klavžar, S.: Handbook of Product Graphs. CRC Press, Taylor and Francis Group, Boca Raton (2011)MATHGoogle Scholar
  5. 5.
    Kemnitz, A., Marangio, M.: Total colorings of Cartesian products of graphs. Congr. Numer. 165, 99–109 (2003)MathSciNetMATHGoogle Scholar
  6. 6.
    McDiarmid, C.J.H., Sánchez-Arroyo, A.: Total coloring regular bipartite graphs is NP-hard. Discret. Math. 124, 155–162 (1994)CrossRefMATHGoogle Scholar
  7. 7.
    Pranavar, K., Zmazek, B.: On total chromatic number of direct product graphs. J. Appl. Math. Comput. 33(1–2), 449–457 (2010)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Sabidussi, G.: Graph multiplication. Math. Z. 72(1), 446–457 (1960)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Seoud, M.A.: Total chromatic numbers. Appl. Math. Lett. 5(6), 37–39 (1992)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Seoud, M.A.: Total colourings of Cartesian products. Int. J. Math. Educ. Sci. Technol. 28(4), 481–487 (1997)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Tong, C., Xiaohui, L., Yuanshenga, Y., Zhihe, L.: Equitable total coloring of \(C_{n}\square C_m\). Discret. Appl. Math. 157, 596–601 (2009)CrossRefGoogle Scholar
  12. 12.
    Vizing, V.G.: The Cartesian product of graphs. Vyc. Sis. 9, 30–43 (1963)MathSciNetGoogle Scholar
  13. 13.
    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)]Google Scholar
  14. 14.
    Yap, H.P.: Total Colourings of Graphs. Springer, Berlin (1996)CrossRefMATHGoogle Scholar
  15. 15.
    Zmazek, B., Žerovnik, J.: Behzad–Vizing conjecture and Cartesian-product graphs. Appl. Math. Lett. 15(6), 781–784 (2002)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Japan KK, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of MathematicsAmrita School of Engineering-CoimbatoreCoimbatoreIndia

Personalised recommendations