@article{Chen2025, 
author = {Hongyu Chen and Li Zhang},
title = {A smaller upper bound for the list injective chromatic number of planar graphs},
year = {2025},
journal = {AIMS Mathematics},
volume = {10},
number = {1},
pages = {289-310},
keywords = {maximum degree, girth, planar graph, list injective coloring},
url = {https://www.sciopen.com/article/10.3934/math.2025014},
doi = {10.3934/math.2025014},
abstract = {An injective vertex coloring of a graph    G is a coloring where no two vertices that share a common neighbor are assigned the same color. If for any list    L of permissible colors with size    k assigned to the vertices    V  (  G  ) of a graph    G, there exists an injective coloring    φ in which    φ  (  v  )  ∈  L  (  v  ) for each vertex    v  ∈  V  (  G  ), then    G is said to be injectively    k-choosable. The notation        χ          i              l        (  G  ) represents the minimum value of    k such that a graph    G is injectively    k-choosable. In this article, for any maximum degree    Δ, we demonstrate that        χ          i              l        (  G  )  ≤  Δ  +  4 if    G is a planar graph with girth    g  ≥  5 and without intersecting 5-cycles.}
}