Total coloring of the prismatic graphs
S. Mohan, Kanagasabapathi Somasundaram · Discrete Mathematics Algorithms and Applications · 2020
A total coloring of a graph is an assignment of colors to all the elements of the graph such that no two adjacent or incident elements receive the same color. A graph [Formula: see text] is prismatic, if for every triangle [Formula: see text], every vertex not in [Formula: see text] has exactly one neighbor in [Formula: see text]. In this paper, we prove the total coloring conjecture (TCC) for prismatic graphs and the tight bound of the TCC for some classes of prismatic graphs.