Skip to main content
SpringerLink
Log in

Injective coloring of planar graphs with girth 5

  • Research Article
  • Published:
Frontiers of Mathematics in China Aims and scope Submit manuscript

Abstract

A coloring of a graph G is injective if its restriction to the neighbour of any vertex is injective. The injective chromatic number χi(G) of a graph G is the least k such that there is an injective k-coloring. In this paper, we prove that for each planar graph with g ≥ 5 and Δ (G) ≥ 20, χi(G) ≤ Δ(G)+ 3.

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. Bu Y H, Chen D, Raspaud A, Wang W. Injective coloring of planar graphs. Discrete Appl. Math., 2009, 157(4): 663–672

    Article  MathSciNet  Google Scholar 

  2. Bu Y H, Lu K. List injective coloring of planar graphs with girth 5, 6, 8. Discrete Appl. Math., 2013, 161(10/11): 1367–1377

    Article  MathSciNet  Google Scholar 

  3. Cranston D, Kim S, Yu G X. Injective colorings of graphs with low average degree. Algorithmica, 2010, 60(3): 553–568

    Article  MathSciNet  Google Scholar 

  4. Cranston D, Kim S, Yu G X. Injective colorings of sparse graphs. Discrete Math., 2010, 310(21): 2965–2973

    Article  MathSciNet  Google Scholar 

  5. Dong W, Lin W S. Injective coloring of planar graphs with girths 6. Discrete Math., 2013, 313(12): 1302–1311

    Article  MathSciNet  Google Scholar 

  6. Dong W, Lin W S. Injective coloring of planar graphs with girths 5. Discrete Math., 2014, 315/316(12): 120–127

    Article  Google Scholar 

  7. Doyon A, Hahn G, Raspaud A. Some bounds on the injective chromatic number of graphs. Discrete Math., 2012, 310(6): 585–590

    MathSciNet  MATH  Google Scholar 

  8. Hahn G, Kratochvíl J, Širáň J, Sotteau D. On the injective chromatic number of graphs. Discrete Math., 2002, 256(1/2): 179–192

    Article  MathSciNet  Google Scholar 

  9. Li R, Xu B G. Injective choosability of planar graphs of girth five and six. Discrete Math., 2012, 312(9): 1260–1265

    Article  MathSciNet  Google Scholar 

  10. Lužar B, Škrekovski S, Tancer M. Injective colorings of planar graphs with few colors. Discrete Math., 2009, 309(18): 5636–5649

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This paper was supported by the National Natural Science Foundation of China (No. 11771403).

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, Zhejiang Normal University, Jinhua, 321004, China

    Yuehua Bu & Piaopiao Ye

  2. Xingzhi College, Zhejiang Normal University, Jinhua, 321004, China

    Yuehua Bu

Authors
  1. Yuehua Bu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Piaopiao Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuehua Bu.

Additional information

Translated from Advances in Mathematics (China), 2018, 47(3): 363–372

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bu, Y., Ye, P. Injective coloring of planar graphs with girth 5. Front. Math. China 17, 473–484 (2022). https://doi.org/10.1007/s11464-022-1018-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11464-022-1018-x

Keywords

MSC2020

Search

Navigation