Journal of Combinatorial Optimization

, Volume 19, Issue 2, pp 123–133

Adjacent vertex distinguishing total colorings of outerplanar graphs

Article

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.

Keywords

Adjacent vertex distinguishing total coloring Outerplanar graph Maximum degree 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Department of MathematicsZhejiang Normal UniversityJinhuaChina

Personalised recommendations