Author:
Brandstädt Andreas,Mosca Raffaele
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. Perfect codes in graphs;Biggs;J. Combin. Theory Ser. B,1973
2. Efficient edge domination on hole-free graphs in polynomial time;Brandstädt,2010
3. A. Brandstädt, R. Mosca, Finding dominating induced matchings in S2,2,3-free graphs in polynomial time, 2017. arXiv:1706.04894.
4. A. Brandstädt, R. Mosca, Dominating induced matchings in S1,2,4-free graphs, 2017. arXiv:1706.09301.
5. Dominating induced matchings for P7-free graphs in linear time;Brandstädt;Algorithmica,2014
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献