, Volume 19, Issue 2, pp 123-133
Date: 17 May 2008

Adjacent vertex distinguishing total colorings of outerplanar graphs

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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

Research supported partially by NSFC (No.10771197).