Total coloring of generalized sierpiński graphs
J. Geetha, Kanagasabapathi Somasundaram · 2015
A total coloring of a graph is an assignment of colors to all the elements of the graph in such a way that no two adjacent or incident elements receive the same color. In this paper, we prove the tight bound of the Behzad and