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.
Original language | English (US) |
---|---|
Pages (from-to) | 1-3 |
Number of pages | 3 |
Journal | Discrete Mathematics |
Volume | 326 |
Issue number | 1 |
DOIs | |
State | Published - Jul 6 2014 |
Keywords
- Adjacency Lemma
- Critical graphs
- Edge coloring
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics