Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Atallah, M.J., Manacher, G.K., Urrutia, J.: Finding a minimum independent dominating set in a permutation graph. Discrete Appl. Math. 21, 177–183 (1988)
2. Bange, D.W., Barkauskas, A.E., Slater, P.T.: Efficient dominating sets in graphs. In: Ringeisen, R.D., Roberts, F.S. (eds.) Applications of Discrete Mathematics, pp. 189–199. SIAM (1988)
3. Bertossi, A.A.: On the domatic number of interval graphs. Information Processing Letters 28(6), 275–280 (1988)
4. Chang, G.J., Rangan, C.P., Coorg, S.R.: Weighted independent perfect domination on cocomparability graphs. Technical Report 93-24, DIMACS (April 1993)
5. Cockayne, E.J., Hedetniemi, S.T.: Optimal domination in graphs. IEEE Trans. Circuit and Systems CAS-22, 855–857 (1975)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献