Publication Type:

Journal Article

Source:

Graphs and Combinatorics (2018), Volume 34, Issue 2, p.339–347 (2018)

URL:

https://link.springer.com/article/10.1007%2Fs00373-018-1876-x

Keywords:

Direct product, Lexicographic product, Product graphs, Strong product, Total coloring

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.

Notes:

cited By 0

Cite this Research Publication

J. Geetha and Dr. Somasundaram K., “Total Colorings of Product Graphs”, Graphs and Combinatorics (2018), vol. 34, no. 2, pp. 339–347, 2018.