Publication Type : Journal Article
Source : Discrete Mathematics, Algorithms and Applications, Vol. 13, No. 05, 2150060 (2021), DOI: https://doi.org/10.1142/S1793830921500609
Url : https://www.worldscientific.com/doi/abs/10.1142/S1793830921500609
Campus : Coimbatore
School : School of Engineering
Department : Mathematics
Year : 2021
Abstract : A total coloring of a graph is an assignment of colors to all the elements (vertices and edges) of the graph such that no two adjacent or incident elements receive the same color. A claw-free graph is a graph that does not have K1,3 as an induced subgraph. Quasi-line and inflated graphs are two well-known classes of claw-free graphs. In this paper, we prove that the quasi-line and inflated graphs are totally colorable. In particular, we prove the tight bound of the total chromatic number of some classes of quasi-line graphs and inflated graphs.
Cite this Research Publication : S. Mohan, J. Geetha and K. Somasundaram, "Total coloring of quasi-line graphs and inflated graphs", Discrete Mathematics, Algorithms and Applications, Vol. 13, No. 05, 2150060 (2021), DOI: https://doi.org/10.1142/S1793830921500609