Skip to main content
Log in

The adjacent vertex distinguishing total coloring of planar graphs

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Appel K, Haken W (1976) Every planar graph map is four colorable. Bull Am Math Soc 82:711–712

    Article  MATH  MathSciNet  Google Scholar 

  • Chen X (2008) On the adjacent vertex distinguishing total coloring numbers of graphs with Δ=3. Discrete Math 308:4003–4007

    Article  MATH  MathSciNet  Google Scholar 

  • 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)

    Article  Google Scholar 

  • Hulgan J (2009) Concise proofs for adjacent vertex-distinguishing total colorings. Discrete Math 309:2548–2550

    Article  MATH  MathSciNet  Google Scholar 

  • Vizing V (1964) On an estimate of the chromatic index of a p-graph. Diskret Anal 3:25–30

    MathSciNet  Google Scholar 

  • Wang H (2007) On the adjacent vertex distinguishing total chromatic number of the graphs with Δ(G)=3. J Comb Optim 14:87–109

    Article  MATH  MathSciNet  Google Scholar 

  • Wang W, Wang Y (2008) Adjacent vertex distinguishing total coloring of graphs with lower average degree. Taiwan J Math 12:979–990

    MATH  Google Scholar 

  • 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 

  • Wang Y, Wang W (2010) Adjacent vertex distinguishing total colorings of outerplanar graphs. J Comb Optim 19:123–133

    Article  MATH  MathSciNet  Google Scholar 

  • 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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Weifan Wang.

Additional information

First author is supported partially by NSFC (No. 11071223), ZJNSFC (No. Z6090150), ZJIP (No. T200905), ZSDZZZZXK13 and IP-OCNS-ZJNU. Second author is supported by the Foundation of Zhejiang Educational Committee (No. Y201226078).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, W., Huang, D. The adjacent vertex distinguishing total coloring of planar graphs. J Comb Optim 27, 379–396 (2014). https://doi.org/10.1007/s10878-012-9527-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-012-9527-2

Keywords

Navigation