Skip to main content
SpringerLink
Log in

Total colorings of planar graphs with maximum degree at least 8

  • Published:
Science in China Series A: Mathematics Aims and scope Submit manuscript

Abstract

Planar graphs with maximum degree Δ ⩾ 8 and without 5- or 6-cycles with chords are proved to be (δ + 1)-totally-colorable.

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

  1. Bondy J A, Murty U S R. Graph Theory. Berlin: Springer, 2008

    MATH  Google Scholar 

  2. Vizing V G. Some unsolved problems in graph theory. Russian Math Surveys, 23: 117–134 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  3. Behzad M. Graphs and their chromatic numbers. PhD Thesis. Ease Lansing, MI: Michigan State University, 1965

    Google Scholar 

  4. Wang Y Q, Shangguan M L, Li Q. On total chromatic number of planar graphs without 4-cycles. Sci China Ser A, 50: 81–86 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  5. Borodin O V, Kostochka A V, Woodall D R. Total colorings of planar graphs with large maximum degree. J Graph Theory, 26(1): 53–59 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  6. Wang W F. Total chromatic number of planar graphs with maximum degree ten. J Graph Theory, 54: 91–102 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kowalik L, Sereni J S, Škrekovski R. Total colouring of plane graphs with maximum degree nine. SIAM J Discrete Math, 22: 1462–1479 (2008)

    Article  MathSciNet  Google Scholar 

  8. Borodin O V, Kostochka A V, Woodall D R. Total colouring of planar graphs with large girth. European J Combin, 19: 19–24 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hou J F, Liu G Z, Cai J S. List edge and list total coloring of planar graphs without 4-cycles. Theoret Comput Sci, 369: 250–255 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. Hou J F, Zhu Y, Liu G Z, et al. Total coloring of planar graphs without small cycles. Graphs Combin, 24: 91–100 (2008)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua, 321004, China

    Lan Shen & YingQian Wang

Authors
  1. Lan Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. YingQian Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to YingQian Wang.

Additional information

This work was supported by Natural Science Foundation of Ministry of Education of Zhejiang Province, China (Grant No. 20070441)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shen, L., Wang, Y. Total colorings of planar graphs with maximum degree at least 8. Sci. China Ser. A-Math. 52, 1733–1742 (2009). https://doi.org/10.1007/s11425-008-0155-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11425-008-0155-3

Keywords

MSC(2000)

Search

Navigation