Skip to main content
SpringerLink
Log in

Adjacent vertex distinguishing total colorings of outerplanar 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 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.

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

Access this article

Log in via an institution

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 

  • 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

    Google Scholar 

  • 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

    MATH  MathSciNet  Google Scholar 

  • Fiorini S (1975) On the chromatic index of outerplanar graphs. J Comb Theory Ser B 18:35–38

    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 

  • Vizing V (1968) Some unsolved problems in graph theory. Usp Mat Nauk 23:117–134 (in Russian)

    MATH  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, Zhang K (1999) Δ-matchings and edge-face chromatic numbers. Acta Math Appl Sin 22:236–242

    MATH  Google Scholar 

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

    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

  1. Department of Mathematics, Zhejiang Normal University, Jinhua, 321004, Zhejiang, China

    Yiqiao Wang & Weifan Wang

Authors
  1. Yiqiao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weifan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Weifan Wang.

Additional information

Research supported partially by NSFC (No.10771197).

Rights and permissions

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-008-9165-x

Keywords

Search

Navigation