Author:
Brandstädt Andreas,Le Van Bang,Mahfud Suhail
Publisher
Springer Berlin Heidelberg
Reference63 articles.
1. Alekseev, V.E.: On the number of maximal stable sets in graphs from hereditaryclasses, Combinatorial-algebraic Methods in Discrete Optimization, pp. 5–8. University of Nizhny Novgorod (1991) (in Russian)
2. Alekseev, V.E.: A polynomial algorithm for finding largest independent sets in forkfree graphs, Discrete Anal. Oper. Res. Ser. 1, 6, 3-19 (1999) (in Russian). see also Discrete Applied Math. 135, 3-16 (2004) for the English version
3. Alekseev, V.E.: On easy and hard hereditary classes of graphs with respect to the independent set problem. Discrete Applied Math. 132, 17–26 (2004)
4. Arbib, C., Mosca, R.: On (P5,diamond)-free graphs. Discrete Math. 250, 1–22 (2002)
5. Balas, E., Yu, C.S.: On graphs with polynomially solvable maximum-weight clique problem. Networks 19, 247–253 (1989)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献