Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\)

DOI10.1016/S0012-365X(97)00219-7zbMath0958.05057OpenAlexW2048804026WikidataQ123160825 ScholiaQ123160825MaRDI QIDQ1584243

Artem V. Pyatkin

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00219-7

zbMATH Keywords

multigraphedge coloringedge chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The incidentor coloring of multigraphs and its applications

Cites Work

• The edge chromatic number of a directed/mixed multigraph
• Unnamed Item

This page was built for publication: Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\)