Magnús M. Halldórsson

Maxime Flin, Magnús M. Halldórsson

Reed [J.~Comb.~Theory B, 1999] showed that graphs of maximum degree $Δ\geq 10^{14}$ without $Δ$-cliques are $(Δ-1)$-colorable. We design a one-pass semi-streaming algorithm for computing such a coloring. Additionally, we prove that any one-pass $(Δ-k)$-coloring algorithm for $0\leq k < (Δ+1)/2$ requires $Ω(n(k+1))$ space.