%0 Journal Article
%T On the maximum average degree and the incidence chromatic number of a graph
%A Mohammad Hosseini Dolama
%A Eric Sopena
%J Discrete Mathematics & Theoretical Computer Science
%D 2005
%I Discrete Mathematics & Theoretical Computer Science
%X We prove that the incidence chromatic number of every 3-degenerated graph G is at most ¦¤(G)+4. It is known that the incidence chromatic number of every graph G with maximum average degree mad(G)<3 is at most ¦¤ (G)+3. We show that when ¦¤ (G) ¡Ý 5, this bound may be decreased to ¦¤ (G)+2. Moreover, we show that for every graph G with mad(G)<22/9 (resp. with mad(G)<16/7 and ¦¤ (G)¡Ý 4), this bound may be decreased to ¦¤(G)+2 (resp. to ¦¤(G)+1).
%U http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/68