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.
cited By 0
J. Geetha and Dr. Somasundaram K., “Total Colorings of Product Graphs”, Graphs and Combinatorics (2018), vol. 34, no. 2, pp. 339–347, 2018.