Publisher
Springer Science and Business Media LLC
Reference8 articles.
1. Bacsó, G., Tuza, Z.: Dominating cliques in $$P_{5} $$-free graphs. Period. Math. Hungar. 21, 303–308 (1990)
2. Camby, E., Schaudt, O.: The price of connectivity for dominating set: Upper bounds and complexity. Discret. Appl. Math. 177, 53–59 (2014)
3. Camby, E., Schaudt, O.: A new characterization of $$P_{k} $$-free graphs. Algorithmica. 75, 205–217 (2016)
4. Chellali, M., Favaron, O.: Connected domination, Topics in Domination in Graphs (T.W. Haynes, S.T. Hedetniemi, and M.A. Henning, eds.), pp. 79–127. Springer, Berlin/Heidelberg (2020)
5. Cozzens, M.B., Kelleher, L.L.: Dominating cliques in graphs. Discret. Math. 86, 101–116 (1990)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献