A Constructive Proof of Vizing's Theorem

  title={A Constructive Proof of Vizing's Theorem},
  author={Jayadev Misra and David Gries},
  journal={Inf. Process. Lett.},
We consider finite graphs with no self-loops and no multiple edges. A graph is valid if all edges incident on a vertex have different colors. We prove Vizing’s Theorem. All the edges of a graph of maximum degree less than N can be colored using N colors so that the graph is valid. We call a color incident on a vertex if an edge incident on that vertex has that color; otherwise, the color is free on that vertex. Since there are N available colors and each vertex degree is less than N , there is… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.
79 Citations
2 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 79 extracted citations


Publications referenced by this paper.
Showing 1-2 of 2 references

Designing the proof of Vizing's algorithm. EWD1082a, Computer Sciences, University of Texas at Austin

  • E. W. Dijkstra, J. R. Rao
  • 1990

Designing the proof of Vizing ' s algorithm

  • E. W. Dijkstra, J. R. Rao
  • 1979

Similar Papers

Loading similar papers…