An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors

Lucas De Meyer, František Kardoš, Aurélie Lagoutte +1

The problem of sampling edge-colorings of graphs with maximum degree $\Delta$ has received considerable attention and efficient algorithms are available when the number of colors is lar…