Author:
Brandstädt Andreas,Mosca Raffaele
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference12 articles.
1. Biggs, N.: Perfect codes in graphs. J. Comb. Theory Ser. B 15, 289–296 (1973)
2. Brandstädt, A., Hundt, C., Nevries, R.: Efficient edge domination on hole-free graphs in polynomial time. In: Conference Proceedings LATIN 2010. Lecture Notes in Computer Science, vol. 6034, pp. 650–661 (2010)
3. Brandstädt, A., Leitert, A., Rautenbach, D.: Efficient dominating and edge dominating sets for graphs and hypergraphs, extended abstract. In: Conference Proceedings ISAAC 2012, Taiwan. Lecture Notes in Computer Science, vol. 7676, pp. 267–277 (2012). Full version: arXiv:1207.0953v2 [cs.DM]
4. Brandstädt, A., Mosca, R.: Dominating induced matchings for $$P_7$$ P 7 -free graphs in linear time. Algorithmica 68, 998–1018 (2014)
5. Cameron, K., Sritharan, R., Tang, Y.: Finding a maximum induced matching in weakly chordal graphs. Discrete Math. 266, 133–142 (2003)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献