Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. Berger, A., Parekh, O.: Linear time algorithms for generalized edge dominating set problems. Algorithmica 50(2), 244–254 (2008)
2. Büyükçolak, Y., Gözüpek, D., Özkan, S.: Triangle-free equimatchable graphs. J. Graph Theory 99(3), 461–484 (2022)
3. Finbow, A., Hartnell, B., Nowakowski, R.: Well-dominated graphs: a collection of well-covered ones. Ars Comb. 25A, 5–10 (1988)
4. Frendrup, A., Hartnell, B., Vestergaard, P.L.: A note on equimatchable graphs. Aust. J. Comb. 46, 185–190 (2010)
5. Horton, J.D., Kilakos, K.: Minimum edge dominating sets. SIAM J. Discrete Math. 6(3), 375–387 (1993)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献