Author:
Dakhno G. S.,Malyshev D. S.
Subject
Applied Mathematics,Industrial and Manufacturing Engineering
Reference11 articles.
1. V. E. Alekseev, D. V. Korobitsyn, and V. V. Lozin, “Boundary classes of
graphs for the dominating set problem,” Discrete Math. 285 (1–3), 1–6 (2004).
2. D. S. Malyshev, “A complexity dichotomy and a new boundary class for the
dominating set problem,” J. Combin. Optim. 32, 226–243
(2016).
3. V. E. Alekseev, “On easy and hard hereditary classes of graphs with respect
to the independent set problem,” Discrete Appl. Math. 132, 17–26 (2003).
4. V. E. Alekseev, R. Boliac, D. V. Korobitsyn, and V. V. Lozin, “NP-hard
graph problems and boundary classes of graphs,” Theor. Comput. Sci. 389, 219–236 (2007).
5. D. V. Korobitsyn, “On the complexity of determining the dominance number
in monogenic classes of graphs,” Diskretn. Mat. 2, 90–96
(1990).