A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs

For a given graph, the edge-coloring problem is to minimize the number of colors sufficient to color all the graph edges so that any adjacent edges receive different colors. For all classes defined by sets of forbidden subgraphs, each with 7 edges, the complexity status of this problem is known. In this paper, we obtain a similar result for all sets of 8-edge prohibitions. Illustr. 2, bibliogr. 38.