Total colorings of some classes of four regular circulant graphs

Total colorings of some classes of four regular circulant graphs

AbstractThe total chromatic number, [Formula: see text] 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, [Formula: see text] where [Formula: see text] r...

Full description

Bibliographic Details
Main Authors: R. Navaneeth, J. Geetha, K. Somasundaram, Hung-Lin Fu
Format: Article
Language:English
Published: Taylor & Francis Group 2024-01-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Total coloring
circulant graphs
05C15 (primary)
05b15 (secondary)
Online Access:https://www.tandfonline.com/doi/10.1080/09728600.2022.2088316
Description
Summary:AbstractThe total chromatic number, [Formula: see text] 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, [Formula: see text] where [Formula: see text] represents the maximum degree of G. In this paper we obtained the total chromatic number for some classes of four regular circulant graphs.
ISSN:0972-8600
2543-3474

Similar Items