Abstract :
Melnikov and Vizing (1997) conjectured that the minimum number of colors sufficient for an edge coloring of mixed multigraph does not exceed either its edge chromatic number or its maximum degree plus one. In this note, this conjecture is proved for multigraphs with maximum degree at most 3.
