Injective coloring of planar graphs with girth 5.
- Resource Type
- Article
- Authors
- Bu, Yuehua; Ye, Piaopiao
- Source
- Frontiers of Mathematics in China. Jun2022, Vol. 17 Issue 3, p473-484. 12p.
- Subject
- *GRAPH coloring
*PLANAR graphs
- Language
- ISSN
- 1673-3452
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. [ABSTRACT FROM AUTHOR]