Author:
Brešar Boštjan,Henning Michael A.,Klavžar Sandi,Rall Douglas F.
Publisher
Springer International Publishing
Reference47 articles.
1. Bartnicki, T., Brešar, B., Grytczuk, J., Kovše, M., Miechowicz, Z., Peterin, I.: Game chromatic number of Cartesian product graphs. Electron. J. Combin. 15, Paper 72, 13 pp. (2008)
2. Blank, M.M.: An estimate of the external stability number of a graph without suspended vertices. Prikl. Mat. i Programmirovanie. 3–11, 149 (1973)
3. Brešar, B., Dorbec, P., Klavžar, S., Košmrlj, G.: Domination game: effect of edge- and vertex-removal. Discrete Math. 330, 1–10 (2014)
4. Brešar, B., Dorbec, P., Klavžar, S., Košmrlj, G.: How long can one bluff in the domination game? Discuss. Math. Graph Theory 37, 337–352 (2017)
5. Brešar, B., Dorbec, P., Klavžar, S., Košmrlj, G., Renault, G.: Complexity of the game domination problem. Theoret. Comput. Sci. 648, 1–7 (2016)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Paired-domination game played on cycles;Discrete Applied Mathematics;2023-09