Publication Type : Journal Article
Source : AKCE Journal of Graphs and Combinatorics, available in online, 2023.
Url : https://www.tandfonline.com/doi/full/10.1080/09728600.2023.2187960
Campus : Coimbatore
School : School of Engineering
Department : Mathematics
Verified : No
Year : 2023
Abstract : The smallest integer k needed for the assignment of colors to the elements so that the coloring is proper (vertices and edges) is called the total chromatic number of a graph. Vizing [86] and Behzed [4, 5] conjectured that the total coloring can be done using at most ∆(G) + 2 colors, where ∆(G) is the maximum degree of G. It is not settled even for planar graphs. In this paper we give a survey on total coloring of graphs.
Cite this Research Publication : J.Geetha, N. Narayanan, K. Somasundaram, Total Coloring- a Survey, AKCE Journal of Graphs and Combinatorics, available in online, 2023.