Abstract
In this paper, we have obtained upper bounds for the total chromatic number of some classes of Cayley graphs, odd graphs and mock threshold graphs.
Funding Statement
This research work was supported by SERB, India (No.SERB: EMR/2017/001869).
Acknowledgments
The authors thank the anonymous reviewers for their careful look and several valuable suggestions that helped us improve the presentation.
Citation
Shantharam Prajnanaswaroopa. Jayabalan Geetha. Kanagasabapathi Somasundaram. Hung-Lin Fu. Narayanan Narayanan. "On Total Coloring of Some Classes of Regular Graphs." Taiwanese J. Math. 26 (4) 667 - 683, August, 2022. https://doi.org/10.11650/tjm/220105
Information