1. Alber J, Fernau H and Niedermeier R, Parametrized complexity: Exponential speed-up for planar graph problems, J. Algorithms 52 (2004) 26–56
2. Arumugam S, Ebadi Karam and Manrique Martín, Co-secure domination in graphs, Util. Math. 94 (2014) 167–182
3. Booth K S, Dominating sets in chordal graphs, Research Report CS-80-34 (1980) (Univ. of Waterloo)
4. Booth K S and Johnson J H, Dominating sets in chordal graphs, SIAM J. Comput. 11 (1982) 191–199
5. Burger A P, Cockayne E J, Gründlingh W R, Mynhardt C M, van Vuuren J H and Winterbach W, Finite order domination in graphs, J. Combin. Math. Combin. Comput. 49 (2004) 159–175