Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. D. W. Bange, A. E. Barkauskas, and P. T. Slater, Efficient dominating sets in graphs, Applications of Discrete Mathematics, R. D. Ringeisen and F. S. Roberts, eds., SIAM, Philad. (1988)189–199.
2. G. J. Chang, Private communication.
3. G. J. Chang, C. Pandu Rangan and S. R. Coorg, Weighted independent perfect domination on cocomparability graphs, Lecture Notes in Computer Science, Vol. 766, Springer-Verlag, (1993) 506–514.
4. M. S. Chang and Y. C. Liu, Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs, Information Process. Lett. 48 (1993) 205–210.
5. D. G. Corneil and L. Stewart, Dominating sets in perfect graphs, Discrete Math. 86 (1990) 145–164.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献