Title of article
Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most 3
Author/Authors
A.V. Pyatkin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
4
From page
275
To page
278
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.
Journal title
Discrete Mathematics
Serial Year
1998
Journal title
Discrete Mathematics
Record number
951034
Link To Document