Author:
Brandstädt Andreas,Mosca Raffaele
Reference16 articles.
1. A characterization of graphs without long induced paths;Bacsó;J. Graph Theory,1990
2. Perfect codes in graphs;Biggs;J. Comb. Theory, Ser. B,1973
3. Efficient edge domination on hole-free graphs in polynomial time;Brandstädt,2010
4. Dominating induced matchings for P7-free graphs in linear time;Brandstädt;Algorithmica,2014
5. Finding dominating induced matchings in P8-free graphs in polynomial time;Brandstädt;Algorithmica,2017