On the adjacent vertex distinguishing total coloring numbers of graphs with Δ=3

Xiang'en Chen
2008 Discrete Mathematics  
An adjacent vertex distinguishing total-coloring of a simple graph G is a proper total-coloring of G such that no pair of adjacent vertices meets the same set of colors. The minimum number of colors a (G) required to give G an adjacent vertex distinguishing total-coloring is studied. We proved a (G) 6 for graphs with maximum degree (G) = 3 in this paper.
doi:10.1016/j.disc.2007.07.091 fatcat:oefh3wargnahlamsxxorkd667y