Vizing theorem (source code)

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

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

Back to article page