Explore relationships

Vizing's theorem

In graph theory, Vizing's theorem states that every simple undirected graph may be edge colored using a number of colors that is at most one larger than the maximum degreeΔ of the graph.

Use + to expand a branch. Click a topic name to open its summary.