Edge Coloring

Edge coloring is the process of assigning colors to the edges of a graph so that no two edges of the same color meet at the same vertex. 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.

Edge chromatic number equals?___________

Next, adapt the graph coloring algorithm to make it work for edge coloring.

  1. Step 1

  2. Step 2

  3. Step 3

  4. More Steps?