Author:
Dabrowski Konrad K.,Lozin Vadim V.,de Werra Dominique,Zamaraev Viktor
Funder
Agence Nationale de la Recherche
Engineering and Physical Sciences Research Council
Russian Federation Government
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. Alekseev, V.: A polynomial algorithm for finding the largest independent sets in fork-free graphs. Diskretn. Anal. Issled. Oper. Ser. 1 6(4), 3–19 (1999) (in Russian; English translation in Alekseev, V.: Polynomial algorithm for finding the largest independent sets in graphs without forks. Disc. App. Math. 135(1–3), 3–16 (2004))
2. Berge, C.: Two theorems in graph theory. Proc. Natl. Acad. Sci. USA 43(9), 842–844 (1957)
3. Dabrowski, K.K., Demange, M., Lozin, V.V.: New results on maximum induced matchings in bipartite graphs and beyond. Theor. Comput. Sci. 478, 33–40 (2013)
4. Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449–467 (1965)
5. Gerber, M.U., Hertz, A., Lozin, V.V.: Augmenting chains in graphs without a skew star. J. Comb. Theory B 96(3), 352–366 (2006)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献