English

Injective colorings of sparse graphs

Combinatorics 2011-10-12 v1

Abstract

Let mad(G)mad(G) denote the maximum average degree (over all subgraphs) of GG and let χi(G)\chi_i(G) denote the injective chromatic number of GG. We prove that if mad(G)5/2mad(G) \leq 5/2, then χi(G)Δ(G)+1\chi_i(G)\leq\Delta(G) + 1; and if mad(G)<42/19mad(G) < 42/19, then χi(G)=Δ(G)\chi_i(G)=\Delta(G). Suppose that GG is a planar graph with girth g(G)g(G) and Δ(G)4\Delta(G)\geq 4. We prove that if g(G)9g(G)\geq 9, then χi(G)Δ(G)+1\chi_i(G)\leq\Delta(G)+1; similarly, if g(G)13g(G)\geq 13, then χi(G)=Δ(G)\chi_i(G)=\Delta(G).

Keywords

Cite

@article{arxiv.1007.0786,
  title  = {Injective colorings of sparse graphs},
  author = {Daniel W. Cranston and Seog-Jin Kim and Gexin Yu},
  journal= {arXiv preprint arXiv:1007.0786},
  year   = {2011}
}

Comments

10 pages

R2 v1 2026-06-21T15:44:43.720Z