Subject
Applied Mathematics,Industrial and Manufacturing Engineering
Reference36 articles.
1. M. R. Garey and D. S. Johnson, Computers and
Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco,
1979; Mir, Moscow, 1982).
2. I. Holyer, “The NP-Completeness of Edge-Coloring,” SIAM J. Comput.
10 (4), 718–720 (1981).
3. V. G. Vizing, “On Estimation of the Chromatic Index of a $$p
$$-Graph,” in Discrete
Analysis Vol. 3 (Inst. Mat. Sibir. Otd. Akad. Nauk SSSR, Novosibirsk, 1964),
pp. 25–30.
4. D. Král’, J. Kratochvíl, Z. Tuza, and G. J. Woeginger,
“Complexity of Coloring Graphs without Forbidden Induced Subgraphs,” in Proceedings of 27th International Workshop on Graph-Theoretic Concepts
of Computing Sciences, Boltenhagen, Germany, June 14–16, 2001 (Springer,
Heidelberg, 2001), pp. 254–262 [Lecture Notes in Computer
Sciences, Vol. 2204].
5. V. V. Lozin and D. S. Malyshev, “Vertex Coloring of Graphs with Few
Obstructions,” Discrete Appl. Math. 216, 273–280
(2017).