Author:
Mokeev Dmitry B.,Malyshev Dmitry S.
Funder
Laboratory of Algorithms and Technologies for Networks Analysis
Российский Фонд Фундаментальных Исследований
Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. Alekseev, V.E., Mokeev, D.B.: König graphs with respect to the 3-path. Diskretnyi Analiz i Issledovanie Operatsii. 19(4), 3–14 (2012). (in Russian)
2. Alekseev, V.E., Mokeev, D.B.: König graphs for 3-paths and 3-cycles. Discrete Appl. Math. 204, 1–5 (2016)
3. Brešar, B., Kardoš, F., Katrenič, J., Semanišin, G.: Minimum $$k$$-path vertex cover. Discrete Appl. Math. 159(12), 1189–1195 (2011)
4. Cornuéjols, G.: Combinatorial Optimization: Packing and Covering, p. 132. SIAM, New York (2001)
5. Deming, R.W.: Independence numbers of graphs – an extension of the König-Egervary theorem. Discrete Math. 27, 23–33 (1979)