Injective Δ+2 Coloring of Planar Graph Without Short Cycles
Acta Mathematicae Applicatae Sinica, English Series(2023)
Abstract
A coloring of graph G is an injective coloring if its restriction to the neighborhood of any vertex is injective, which means that any two vertices get different colors if they have a common neighbor. The injective chromatic number χ i ( G ) of G is the least integer k such that G has an injective k -coloring. In this paper, we prove that (1) if G is a planar graph with girth g ≥ 6 and maximum degree Δ ≥ 7, then χ i ( G ) ≤ Δ + 2; (2) if G is a planar graph with Δ ≥ 24 and without 3,4,7-cycles, then χ i ( G ) ≤ Δ + 2.
MoreTranslated text
Key words
injective coloring,planar graph,maximum degree,cycle
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined