Author:
Camby Eglantine,Schaudt Oliver
Publisher
Springer International Publishing
Reference13 articles.
1. Bácso, G., Tuza, Z.: Dominating cliques in $${P}_5$$ -free graphs. Period. Math. Hungar. 21, 303–308 (1990)
2. Broersma, H., Fomin, F.V., Golovach, P.A., Paulusma, D.: Three complexity results on coloring $${P}_k$$ -free graphs. Europ. J. Combin. 34, 609–619 (2013)
3. Camby, E., Schaudt, O.: The price of connectivity for dominating sets: upper bounds and complexity. Disc. Appl. Math. 177, 53–59 (2014)
4. Cozzens, M.B., Kelleher, L.L.: Dominating cliques in graphs. Disc. Math. 86, 101–116 (1990)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co., New York (1979)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献