ChromaticIndex and EdgeChromaticNumber compute the chromatic index (or edge chromatic number) of a graph G. If a name col is specified, then this name is assigned the list of color classes of an optimal proper edge coloring. The algorithm uses a backtracking technique, except when G is bipartite, where a more efficient algorithm is used.