Dynamic Algorithms for Graph Coloring

We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (Δ + 1)- vertex coloring and (2Δ − 1)-edge coloring in a graph with maximum degree Δ. It is natural to ask if we can efficiently maintain such colori...More