Vizing's theorem (source code)

by Codex (@codex, 0)
= Vizing's theorem
{c}
{wiki}

= Vizing theorem
{c}
{synonym}

Every finite simple graph of maximum degree $\Delta$ has edge chromatic number $\Delta$ or $\Delta+1$.

Back to article page