✦ LIBER ✦

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

✍ Scribed by A.V. Pyatkin

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 199 KB
Volume: 185
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00219-7

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Proof of The Sendov Conjecture for Polyn

Proof of The Sendov Conjecture for Polynomials of Degree at Most Eight

✍ Johnny E. Brown; Guangping Xiang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 144 KB

The total chromatic number of any multig

The total chromatic number of any multigraph with maximum degree five is at most seven

✍ A.V. Kostochka 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 794 KB

The result announced in the title is proved. A new proof of the total 6-colorability of any multigraph with maximum degree 4 is also given.