Edge Coloring

So far we have been assigning colors to the

The smallest number of colors needed to color a graph is
called the **edge chromatic number** of the graph.

Find the edge chromatic number of the following graph:

Adapt the algorithm from the
previous page for edge coloring.

Next: Polyhedra

Back: Algorithms