Publication Type : Journal Article
Publisher : Electronic Notes in Discrete Mathematics
Source : Electronic Notes in Discrete Mathematics, Volume 53, p.173 - 180 (2016)
Url : //www.sciencedirect.com/science/article/pii/S1571065316300701
Keywords : Bipartite graphs, Complete graphs, Compound graph, Product graph, Total coloring
Campus : Coimbatore
School : School of Engineering
Department : Mathematics
Year : 2016
Abstract : 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, J. Geetha, and Dr. Somasundaram K., “Total Coloring of Certain Classes of Product Graphs”, Electronic Notes in Discrete Mathematics, vol. 53, pp. 173 - 180, 2016.