Complete complexity dichotomy for 7-edge forbidden subgraphs in the edge coloring problem

The edge coloring problem for a graph is to minimize the number of colors that are sufficient to color all edges of the graph so that all adjacent edges receive distinct colors. The computational complexity of the problem is known for all graph classes defined by forbidden subgraphs with at most 6 edges. We improve this result and obtain a complete complexity classification of the edge coloring problem for all sets of prohibitions each of which has at most 7 edges. Illustr. 3, bibliogr. 36.