Publication Type:

Journal Article


Electronic Notes in Discrete Mathematics, Volume 53, p.173 - 180 (2016)




Bipartite graphs, Complete graphs, Compound graph, Product graph, Total coloring


Abstract A total coloring of a graph is an assignment of colors to all the elements of the graph such that no two adjacent or incident elements receive the same color. In this paper, we prove the tight bound of Behzad and Vizing conjecture on total coloring for Compound graph of G and H, where G and H are any graphs.

Cite this Research Publication

S. Mohan, Geetha, J., and Dr. Somasundaram K., “Total Coloring of Certain Classes of Product Graphs”, Electronic Notes in Discrete Mathematics, vol. 53, pp. 173 - 180, 2016.