Total Colorings of Some Classes of FourRegular Circulant Graphs
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.