Vizing's Theorem

Author

Eric W. Weisstein
October 15, 2004

This notebook downloaded from http://mathworld.wolfram.com/notebooks/GraphTheory/VizingsTheorem.nb.

For more information, see Eric's MathWorld entry http://mathworld.wolfram.com/VizingsTheorem.html.

©2005 Wolfram Research, Inc. except for portions noted otherwise

Check

Timing[v=Map[
EdgeChromaticNumber[#]-Max[Degrees[#]]&,
Graphs/@Range[6],
{2}]]

Union[Flatten[v]]