Injective colorings of graphs with low average degree

Abstract

Let (G) denote the maximum average degree (over all subgraphs) of G and let i(G) denote the injective chromatic number of G. We prove that if ≥ 4 and (G)<145, then i(G)≤+2. When =3, we show that (G)<3613 implies i(G) 5. In contrast, we give a graph G with =3, (G)=3613, and i(G)=6.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…