1. Benzaken, C., Hammer, P.: Linear separation of dominating sets in graphs. In: Bollobs, B. (ed.) Advances in Graph Theory, Annals of Discrete Mathematics, vol. 3, pp. 1–10. Elsevier (1978),
http://www.sciencedirect.com/science/article/pii/S0167506008704928
2. Lecture Notes in Computer Science;A Brandstädt,2012
3. Lecture Notes in Computer Science;A Cournier,1994
4. Finbow, A., Hartnell, B., Nowakowski, R.: Well-dominated graphs: a collection of well-covered ones. Ars Combin. 25, 5–10 (1988)
5. Gutin, G., Zverovich, V.E.: Upper domination and upper irredundance perfect graphs. Discrete Math. 190(1), 95–105 (1998).
http://www.sciencedirect.com/science/article/pii/S0012365X98000363