1. I. Holyer, “The NP-completeness of edge-coloring,” SIAM J. Comput.
10 (4), 718–720 (1981).
2. V. G. Vizing, “On an estimate of the chromatic index of a
$$
p
$$-graph,” in Discrete Analysis (Inst.
Mat. Sib. Otd. Ross. Akad. Nauk, Novosibirsk, 1964), Vol. 3, pp. 25–30.
3. E. Galby, P. T. Lima, D. Paulusma, and B. Ries, “Classifying
$$
k
$$-edge colouring for
$$
H
$$-free graphs,” Inf. Process. Lett. 146,
39–43 (2019).
4. D. S. Malyshev, “The complexity of the edge 3-colorability problem for
graphs without two induced fragments each on at most six vertices,” Sib. Elektron. Mat. Izv.
11, 811–822 (2014).
5. D. S. Malyshev, “Complexity classification of the edge coloring problem for
a family of graph classes,” Discrete Math. Appl. 27 (2),
97–101 (2017).