1. Bange, D.W., Barkauskas, A.E., Slater, P.J.: Efficient dominating sets in graphs. In: Ringeisen, R.D., Roberts, F.S. (eds.) Applications of Discrete Math., pp. 189–199. SIAM, Philadelphia (1988)
2. Bange, D.W., Barkauskas, A.E., Host, L.H., Slater, P.J.: Generalized domination and efficient domination in graphs. Discrete Math. 159, 1–11 (1996)
3. Lecture Notes in Computer Science;R. Belmonte,2011
4. Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: Boolean width of graphs. Theor. Computer Science 412, 5187–5204 (2011)
5. Berge, C.: Graphs and Hypergraphs. North-Holland (1973)