Adjacent vertex distinguishing total colorings of outerplanar graphs

作者：Wang Yiqiao; Wang Weifan^*

来源：Journal of Combinatorial Optimization, 2010, 19(2): 123-133.

DOI：10.1007/s10878-008-9165-x

• Adjacent vertex distinguishing total coloring
• Outerplanar graph
• Maximum degree

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 aEuro(3) (a) (G). In this paper, we characterize completely the adjacent vertex distinguishing total chromatic number of outerplanar graphs.

• 出版日期2010-2
• 单位浙江师范大学