1. Chellali, M., Favaron, O., Hansberg, A., Volkmann, L.:
$$k$$
k
-domination and
$$k$$
k
-independence in graphs: a survey. Graphs Combin. 28(1), 1–55 (2012).
https://doi.org/10.1007/s00373-011-1040-3
2. Erdős, P.: Some of my old and new combinatorial problems. In: Paths, flows, and VLSI-layout (Bonn, 1988), Algorithms Combin., vol. 9, pp. 35–45. Springer, Berlin (1990)
3. Erdős, P., Gallai, T., Tuza, Z.: Covering and independence in triangle structures. Disc. Math. 150(1–3), 89–101 (1996).
https://doi.org/10.1016/0012-365X(95)00178-Y
4. Favaron, O.: On a conjecture of Fink and Jacobson concerning
$$k$$
k
-domination and
$$k$$
k
-dependence. J. Combin. Theory Ser. B 39(1), 101–102 (1985).
https://doi.org/10.1016/0095-8956(85)90040-1
5. Fink, J.F., Jacobson, M.S.:
$$n$$
n
-domination in graphs. In: Graph theory with applications to algorithms and computer science (Kalamazoo, Mich., 1984), Wiley-Intersci. Publ., pp. 283–300. Wiley, New York (1985)