caa a22 4500 44580436X CHVBK 20180317145152.0 cr unu---uuuuu 170323e20110701xx s 000 0 eng 10.1007/s00453-010-9425-x doi (NATIONALLICENCE)springer-10.1007/s00453-010-9425-x Injective Colorings of Graphs with Low Average Degree [Elektronische Daten] [Daniel Cranston, Seog-Jin Kim, Gexin Yu] Let mad (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 $\mathrm{mad}(G)<\frac{14}{5}$, then χ i(G)≤Δ+2. When Δ=3, we show that $\mathrm{mad}(G)<\frac{36}{13}$ implies χ i(G)≤5. In contrast, we give a graph G with Δ=3, $\mathrm{mad}(G)=\frac{36}{13}$, and χ i(G)=6. Springer Science+Business Media, LLC, 2010 Injective coloring nationallicence Discharging method nationallicence Maximum average degree nationallicence List coloring nationallicence Cranston Daniel Department of Mathematics & Applied Mathematics, Virginia Commonwealth University, Richmond, VA, USA aut Kim Seog-Jin Konkuk University, Seoul, Korea aut Yu Gexin College of William and Mary, Williamsburg, VA, USA aut Algorithmica Springer-Verlag 60/3(2011-07-01), 553-568 0178-4617 60:3<553 2011 60 453 https://doi.org/10.1007/s00453-010-9425-x text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s00453-010-9425-x text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Cranston Daniel Department of Mathematics & Applied Mathematics, Virginia Commonwealth University, Richmond, VA, USA aut NATIONALLICENCE 700 1- Kim Seog-Jin Konkuk University, Seoul, Korea aut NATIONALLICENCE 700 1- Yu Gexin College of William and Mary, Williamsburg, VA, USA aut NATIONALLICENCE 773 0- Algorithmica Springer-Verlag 60/3(2011-07-01), 553-568 0178-4617 60:3<553 2011 60 453 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer