Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. On easy and hard hereditary classes of graphs with respect to the independent set problem;Alekseev;Discrete Appl. Math.,2004
2. Efficient dominating sets in graphs;Bange,1988
3. Maximum weight independent sets in hole- and dart-free graphs;Basavaraju;Discrete Appl. Math.,2012
4. Perfect codes in graphs;Biggs;J. Combin. Theory Ser. B,1996
5. Efficient domination for classes of P6-free graphs;Brandstädt;Discrete Appl. Math.,2016
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献