Highly Influenced

# A Constructive Proof of Vizing's Theorem

@article{Misra1992ACP, title={A Constructive Proof of Vizing's Theorem}, author={Jayadev Misra and David Gries}, journal={Inf. Process. Lett.}, year={1992}, volume={41}, pages={131-133} }

- Published 1992 in Inf. Process. Lett.
DOI:10.1016/0020-0190(92)90041-S

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

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-2 of 2 references