Author:
Hedetniemi Stephen T.,McRae Alice A.,Mohan Raghuveer
Publisher
Springer International Publishing
Reference36 articles.
1. D.W. Bange, A.E. Barkauskas, L.H. Host, P.J. Slater, Generalized domination and efficient domination in graphs. Discrete Math. 159(1–3), 1–11 (1996)
2. P. Berman, T. Fujito, On approximation properties of the independent set problem for low degree graphs. Theory Comput. Syst. 32, 115–132 (1999)
3. H.L. Bodlaender, On linear time minor tests and depth-first search, in Proceedings of the 1st Workshop on Algorithms and Data Structures, ed. by F. Dehne, et al. Lecture Notes in Computer Science, vol. 382 (1987), pp. 577–590
4. A. Brandstädt, V.D. Chepoi, F.F. Dragan, The algorithmic use of hypertree structure and maximum neighbourhood orderings. Discrete Appl. Math. 82, 43–77 (1998)
5. I. Broere, J.H. Hattingh, M.A. Henning, A.A. McRae, Majority domination in graphs. Discrete Math. 138(1–3), 125–135 (1995)