Edge-coloring of multigraphs

We introduce a monotone invariant π(G) on graphs and show that it is an upper bound of the chromatic index of graphs. Moreover, there exist polynomial time algorithms for computing π(G) and for coloring edges of a multigraph G by π(G) colors. This generalizes the classical edge-coloring theorems of Shannon and Vizing.