Recognition: unknown
Injective colorings of sparse graphs
classification
🧮 math.CO
keywords
deltathendenoteinjectiveproveaveragechromaticcolorings
read the original abstract
Let $mad(G)$ denote the maximum average degree (over all subgraphs) of $G$ and let $\chi_i(G)$ denote the injective chromatic number of $G$. We prove that if $mad(G) \leq 5/2$, then $\chi_i(G)\leq\Delta(G) + 1$; and if $mad(G) < 42/19$, then $\chi_i(G)=\Delta(G)$. Suppose that $G$ is a planar graph with girth $g(G)$ and $\Delta(G)\geq 4$. We prove that if $g(G)\geq 9$, then $\chi_i(G)\leq\Delta(G)+1$; similarly, if $g(G)\geq 13$, then $\chi_i(G)=\Delta(G)$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.