Skip to main content
SpringerLink
Log in

On 3-colorability of planar graphs without adjacent short cycles

  • Articles
  • Published:
Science China Mathematics Aims and scope Submit manuscript

Abstract

A short cycle means a cycle of length at most 7. In this paper, we prove that planar graphs without adjacent short cycles are 3-colorable. This improves a result of Borodin et al. (2005).

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. Abbott H L, Zhou B. On small faces in 4-critical graphs. Ars Combin, 1991, 32: 203–207

    MATH  MathSciNet  Google Scholar 

  2. Bondy J A, Murty U S R. Graph Theory. Berlin: Springer-Verlag, 2008

    Book  MATH  Google Scholar 

  3. Borodin O V. Structural properties of plane graphs without adjacent triangles and an application to 3-colorings. J Graph Theory, 1996, 21: 183–186

    Article  MATH  MathSciNet  Google Scholar 

  4. Borodin O V, Glebov A N, Raspaud A, et al. Planar graphs without cycles of length from 4 to 7 are 3-colorable. J Combin Theory Ser B, 2005, 93: 303–311

    Article  MATH  MathSciNet  Google Scholar 

  5. Grötzsch H. Ein Drefarbensatz fur dreikreisfreie Netze auf der Kugel. Wiss Z Martin-Luther-Univ Halle-Wittenberg, Mat-Natur Reche, 1959, 8: 109–120

    Google Scholar 

  6. Jensen T R, Toft B. Graph Coloring Problems. New York: Wiley, 1995

    MATH  Google Scholar 

  7. Sanders D P, Zhao Y. A note on the three coloring problem. Graphs Combin, 1995, 11: 92–94

    Article  MathSciNet  Google Scholar 

  8. Steinberg R. The state of the three color problem. Ann Diserete Math, 1993, 55, 211–248

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    YingQian Wang, XiangHua Mao & WeiFan Wang

  2. College of Basic Science, Ningbo Dahongying University, Ningbo, 315175, China

    HuaJing Lu

Authors
  1. YingQian Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. XiangHua Mao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. HuaJing Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. WeiFan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to YingQian Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Y., Mao, X., Lu, H. et al. On 3-colorability of planar graphs without adjacent short cycles. Sci. China Math. 53, 1129–1132 (2010). https://doi.org/10.1007/s11425-010-0074-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11425-010-0074-y

Keywords

MSC(2000)

Search

Navigation