Total Coloring of Some Cycle Related Graphs
Iosr Journals, Samir K. VAIDYA, Rakhimol V. Isaac · Figshare · 2015
A total coloring of a graph G is a proper coloring with additional property that no two adjacent or incident graph elements receive the same color. The total chromatic number of a graph G is the smallest positive integer for which G admits a total coloring. Here, we investigate the total chromatic number of some cycle related graphs.