Publications
Sort:
Open Access Research Article Issue
On the list injective coloring of planar graphs without a 4 -cycle intersecting with a 5 -cycle
AIMS Mathematics 2025, 10(1): 1814-1825
Published: 15 January 2025
Abstract PDF (1.4 MB) Collect
Downloads:0

An injective coloring of a graph G is a vertex coloring such that a pair of vertices obtain distinct colors if there is a path of length two between them. It is proved in this paper that χ i l ( G ) Δ + 4 if Δ 12 when G does not have a 4 -cycle intersecting with a 5 -cycle. Our result improves a previous result of Cai et al. in 2023, who showed that χ i l ( G ) Δ + 4 when Δ 12 and G has disjoint 5 -cycles.

Total 1