A constructive proof of Vizing's theorem (Q1186590)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A constructive proof of Vizing's theorem |
scientific article |
Statements
A constructive proof of Vizing's theorem (English)
0 references
28 June 1992
0 references
The proof of Vizing's theorem given in this note is essentially the same proof given by Vizing [see \textit{S. Fiorini} and \textit{R. J. Wilson}: Edge- colourings of graphs, Pitman (1977; Zbl 0421.05023), pp. 30-32]. There are some ambiguities/gaps in the description of the process for ``Inversting the cd-path of \(X\)'' in this note. Vizing's theorem has been generalized by \textit{L. D. Andersen} and also by \textit{M. K. Gol'dberg} [see the reviewer's book: Some topics in graph theory, Cambridge University Press (1986; Zbl 0588.05002), pp. 14-16].
0 references
graph algorithm
0 references
edge-colourings of graphs
0 references
Vizing's theorem
0 references