1. Aazami, A.: Hardness results and approximation algorithms for some problems on graphs. ProQuest LLC, Ann Arbor, MI, 2009. Thesis (Ph.D.)–University of Waterloo (Canada)
2. AIM Minimum Rank-Special Graphs Work Group: Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl. 428, 1628–1648 (2008)
3. Bahadır, S., Gözüpek, D., Doğan, O.: k-total uniform graphs (2020). arXiv:2010.08368v2 [math.CO]
4. Brešar, B., Brezovnik, S.: Grundy domination and zero forcing in regular graphs (2020). arXiv:2010.00637 [math.CO]
5. Brešar, B., Bujtás, C., Gologranc, T., Klavžar, S., Košmrlj, G., Marc, T., Patkós, B., Tuza, Z., Vizer, M.: On Grundy total domination number in product graphs. Discuss. Math. Graph Theory. 41, 225–247 (2021)