Back close

Total colorings of some classes of four regular circulant graphs

Publication Type : Journal Article

Publisher : Taylor & Francis

Source : AKCE International Journal of Graphs and Combinatorics, DOI: 10.1080/09728600.2022.2088316

Url : https://www.tandfonline.com/doi/full/10.1080/09728600.2022.2088316

Campus : Coimbatore

School : School of Engineering, School of Physical Sciences

Department : Mathematics

Year : 2024

Abstract : The total chromatic number, χ''(G) is the minimum number of colors which need to be assigned to obtain a total coloring of the graph G. The Total Coloring Conjecture (TCC) made independently by Behzad and Vizing that for any graph, χ''(G)≤Δ(G)+2, where Δ(G) represents the maximum degree of G. In this paper we obtained the total chromatic number for some classes of four regular circulant graphs.

Cite this Research Publication : R Navaneeth, J Geetha, K Somasundaram, Hung-Lin Fu, "Total colorings of some classes of four regular circulant graphs," AKCE International Journal of Graphs and Combinatorics 21 (1), 1-3, 2024.

Admissions Apply Now