1 citations · 1 across the 5 of their papers we have counts for
1 paper · 1 filter
Joakim Blikstad, Ola Svensson, Radu Vintan +1
Vizing's theorem guarantees that every graph with maximum degree Δ admits an edge coloring using Δ+1 colors. In online settings - where edges arrive one at a time and must be…