Elsevier

Discrete Mathematics

Volume 326, 6 July 2014, Pages 1-3
Discrete Mathematics

Note
A new tool for proving Vizing’s Theorem

https://doi.org/10.1016/j.disc.2014.02.021Get rights and content
Under an Elsevier user license
open archive

Abstract

The known proofs of the famous theorem of Vizing on edge coloring of (multi)graphs are not long but sophisticated. The main goal of this note is to present an auxiliary (multi)digraph that simplifies and facilitates proofs of it. The secondary goal is to use the approach for proofs of Vizing’s Adjacency Lemma and the Andersen–Goldberg Theorem.

Keywords

Edge coloring
Critical graphs
Adjacency Lemma

Cited by (0)