A conditional greedy algorithm for edge-coloring
Mark Goldberg · arXiv (Cornell University) · 2017
We present a novel algorithm for edge-coloring of multigraphs. The correctness of this algorithm for multigraphs with $χ' > Δ+1$ ($χ'$ is the chromatic edge number and $Δ$ is the maximum vertex degree) would prove a long standing conjecture in edge-coloring of multigraphs.