Total coloring of generalized sierpiński graphs
Publication Type:Journal Article
Source:Australasian Journal of Combinatorics, University of Queensland, Volume 63, Number 1, p.58-69 (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 Vizing conjecture on total coloring for the generalized Sierpiński graphs of cycle graphs and hypercube graphs. We give a total coloring for the WK-recursive topology, which also gives the tight bound. © 2015,University of Queensland. All rights reserved.
cited By 0