Linear coloring of sparse graphs

► We study linear coloring of graphs. ► Cranston and Yu conjecture that graphs with maximum average degree less than 3 are linearly ⌈Δ2⌉+2 colorable. ► We prove this conjecture for graphs with maximum average degree less than 2.8.