r-hued coloring of sparse graphs

In this paper, we prove the following results using the well-known discharging method. For a graph G, if mad(G)<125, then χ3(G)≤6; if mad(G)<73, then χ3(G)≤5; if G has no C5-components and mad(G)<83, then χ2(G)≤4.