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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Appel K, Haken W (1976) Every planar graph map is four colorable. Bull Am Math Soc 82:711–712
Behzad M (1965) Graphs and their chromatic numbers. Doctoral thesis, Michigan State University
Chen X (2007) On the adjacent vertex distinguishing total coloring numbers of graphs with Δ=3. Discrete Math. doi:10.1016/j.disc.2007.07.091
Chen X, Zhang Z (2006) Adjacent-vertex-distinguishing total chromatic number on 2-connected outeplane graph with Δ(G)≤4. J Lanzhou Univ Nat Sci 42(6):96–102
Fiorini S (1975) On the chromatic index of outerplanar graphs. J Comb Theory Ser B 18:35–38
Vizing V (1964) On an estimate of the chromatic index of a p-graph. Diskret Anal 3:25–30
Vizing V (1968) Some unsolved problems in graph theory. Usp Mat Nauk 23:117–134 (in Russian)
Wang H (2007) On the adjacent vertex distinguishing total chromatic number of the graphs with Δ(G)=3. J Comb Optim 14:87–109
Wang W, Zhang K (1999) Δ-matchings and edge-face chromatic numbers. Acta Math Appl Sin 22:236–242
Zhang S, Chen X, Liu X (2005) Adjacent-vertex-distinguishing total chromatic numbers on 2-connected outer plane graphs with Δ(G)=5. Xibei Shifan Daxue Xuebao Ziran Kexue Ban 41(5):8–13 (in Chinese)
Zhang Z, Chen X, Li J, Yao B, Lu X, Wang J (2005) On adjacent-vertex-distinguishing total coloring of graphs. Sci China Ser A 48:289–299
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported partially by NSFC (No.10771197).
Rights and permissions
About this article
Cite this article
Wang, Y., Wang, W. Adjacent vertex distinguishing total colorings of outerplanar graphs. J Comb Optim 19, 123–133 (2010). https://doi.org/10.1007/s10878-008-9165-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-008-9165-x