1 paper · 1 filter
Abhishek Dhawan
In this paper, we consider algorithms for edge-coloring multigraphs G of bounded maximum degree, i.e., Δ(G)=O(1). Shannon's theorem states that any multigraph of maximum degr…