1. Every planar map is four colorable;Appel;Bull. Amer. Math. Soc.,1976
2. Connected domination and spanning trees with many leaves;Caro;SIAM J. Discrete Math.,2000
3. B. Das, V. Bhargavan, Routing in ad-hoc networks using minimum connected dominating sets, in: IEEE International Conference on Communications, ICC’97, June 1997.
4. Total domination in graphs with diameter two;Desormeaux;J. Graph Theory,2013
5. Domination in planar graphs with small diameter;Goddard;J. Graph Theory,2002