Author:
Gerber Michael U.,Hertz Alain,Lozin Vadim V.
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. A polynomial algorithm for finding largest independent sets in fork-free graphs;Alekseev;Diskretn. Anal. Issled. Oper. Ser.,1999
2. V.E. Alekseev, On easy and hard hereditary classes of graphs with respect to the independent set problem, Discrete Appl. Math. 132 (2004) 17–26.
3. Two theorems in graph theory;Berge;Proc. Nat. Acad. Sci. USA,1957
4. Stability number of bull- and chair-free graphs;De Simone;Discrete Appl. Math.,1993
5. Paths, trees, and flowers;Edmonds;Canad. J. Math.,1965
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. From matchings to independent sets;Discrete Applied Mathematics;2017-11
2. Combinatorics and Algorithms for Augmenting Graphs;Graphs and Combinatorics;2015-12-23
3. On finding augmenting graphs;Discrete Applied Mathematics;2008-07