05701526

j

05701526 Wang, Yiqiao Wang, Weifan Adjacent vertex distinguishing total colorings of outerplanar graphs. J. Comb. Optim. 19, No. 2, 123-133 (2010). 2010 Springer, Dordrecht EN adjacent vertex distinguishing total coloring outerplanar graph maximum degree

doi:10.1007/s10878-008-9165-x

Summary: An adjacent vertex distinguishing total coloring of a graph $G$ is a proper total coloring of $G$ such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing total coloring of $G$ is denoted by $\chi ^{\prime\prime}_{a }(G)$. In this paper, we characterize completely the adjacent vertex distinguishing total chromatic number of outerplanar graphs.