Author:
Brandstadt Andreas,Mosca Raffaele
Reference21 articles.
1. Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs;G Abrishami;Inf. Process. Lett,2018
2. Efficient dominating sets in graphs;D W Bange;Applications of Discrete Math,1988
3. Generalized domination and efficient domination in graphs;D W Bange;Discrete Math,1996
4. Perfect codes in graphs;N Biggs;J. of Combinatorial Theory (B),1973
5. Efficient Domination and Efficient Edge Domination: A Brief Survey;A Brandst�dt;CALDAM 2018,2018