Subject
Applied Mathematics,Industrial and Manufacturing Engineering
Reference13 articles.
1. V. E. Alekseev and D. B. Mokeev, “König Graphs with Respect to 3-Paths,” Diskretn. Anal. Issled. Oper. 19 (4), 3–14 (2012).
2. D. S. Malyshev, “The Impact of the Growth Rate of the Packing Number of Graphs on the Computational Complexity of the Independent Set Problem,” Diskretn. Mat. 25 (2), 63–67 (2013) [Discrete Math. Appl. 23 (3–4), 245–249 (2013)].
3. D. S. Malyshev, “Classes of Graphs Critical for the Edge List-Ranking Problem,” Diskretn. Anal. Issled. Oper. 20 (6), 59–76 (2013) [J. Appl. Indust. Math. 8 (2), 245–255 (2014)].
4. V. E. Alekseev, “On Easy and Hard Hereditary Classes of Graphs with Respect to the Independent Set Problem,” Discrete Appl. Math. 132 (1–3), 17–26 (2004).
5. V. E. Alekseev and D. B. Mokeev, “König Graphs for 3-Paths and 3-Cycles,” Discrete Appl. Math. 204, 1–5 (2016).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献