Author:
Malyshev D. S.,Duginov O. I.
Subject
Applied Mathematics,Industrial and Manufacturing Engineering
Reference14 articles.
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,” Diskretn. Anal. 3, 25–30
(1964).
3. E. Galby, P. T. Lima, D. Paulusma, and B. Ries, “Classifying
$$
k
$$-edge colouring for
$$
H
$$-free graphs,” Inform. 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. Electron. Math. Rep.
11, 811–822 (2014).
5. D. S. Malyshev, “Complexity classification of the edge coloring problem for a
family of graph classes,” Diskretn. Mat. 28 (2), 44–50
(2016) [Discrete Math. Appl. 27 (2), 97–101
(2017)].
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献