Funder
Research Council of Norway
French National Research Agency
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference41 articles.
1. Enumerating minimal dominating sets in chordal graphs;Abu-Khzam;Inf. Process. Lett.,2016
2. Total domination and irredundance in weighted interval graphs;Bertossi;SIAM J. Discrete Math.,1988
3. Breaking the 2n-barrier for irredundance: two lines of attack;Binkele-Raible;J. Discrete Algorithms,2011
4. H. Bodlaender, E. Boros, P. Heggernes, D. Kratsch, Open problems of the Lorentz Workshop, Enumeration Algorithms using Structure, Technical Report Series UU-CS-2015-016, Utrecht University (2016).
5. Graph-theoretic parameters concerning domination, independence, and irredundance;Bollobás;J. Graph Theory,1979
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献