Journal of Combinatorial Optimization

, Volume 27, Issue 2, pp 379–396

The adjacent vertex distinguishing total coloring of planar 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 have distinct sets of colors. The minimum number of colors needed for an adjacent vertex distinguishing total coloring of G is denoted by \(\chi''_{a}(G)\).

In this paper, we characterize completely the adjacent vertex distinguishing total chromatic number of planar graphs G with large maximum degree Δ by showing that if Δ≥14, then \(\varDelta+1\leq \chi''_{a}(G)\leq \varDelta+2\), and \(\chi''_{a}(G)=\varDelta+2\) if and only if G contains two adjacent vertices of maximum degree.

Keywords

Adjacent vertex distinguishing total coloring Planar graph Maximum degree 

References

  1. Appel K, Haken W (1976) Every planar graph map is four colorable. Bull Am Math Soc 82:711–712 CrossRefMATHMathSciNetGoogle Scholar
  2. Chen X (2008) On the adjacent vertex distinguishing total coloring numbers of graphs with Δ=3. Discrete Math 308:4003–4007 CrossRefMATHMathSciNetGoogle Scholar
  3. Huang D, Wang W (2012) Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree. Sci Sin Math 42:151–164 (in Chinese) CrossRefGoogle Scholar
  4. Hulgan J (2009) Concise proofs for adjacent vertex-distinguishing total colorings. Discrete Math 309:2548–2550 CrossRefMATHMathSciNetGoogle Scholar
  5. Vizing V (1964) On an estimate of the chromatic index of a p-graph. Diskret Anal 3:25–30 MathSciNetGoogle Scholar
  6. Wang H (2007) On the adjacent vertex distinguishing total chromatic number of the graphs with Δ(G)=3. J Comb Optim 14:87–109 CrossRefMATHMathSciNetGoogle Scholar
  7. Wang W, Wang Y (2008) Adjacent vertex distinguishing total coloring of graphs with lower average degree. Taiwan J Math 12:979–990 MATHGoogle Scholar
  8. Wang W, Wang P (2009) Adjacent vertex distinguishing total coloring of K 4-minor free graphs. Sci China Ser A 39:1462–1472 (in Chinese) Google Scholar
  9. Wang Y, Wang W (2010) Adjacent vertex distinguishing total colorings of outerplanar graphs. J Comb Optim 19:123–133 CrossRefMATHMathSciNetGoogle Scholar
  10. 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 CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.Department of MathematicsZhejiang Normal UniversityJinhuaChina

Personalised recommendations