1 paper · 1 filter
Nicolas Bousquet, Bastien Durain
Let G=(V,E) be a graph. A (proper) k-edge-coloring is a coloring of the edges of G such that any pair of edges sharing an endpoint receive distinct colors. A classical result…