Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
2. E. J. Cockayne, B. L. Hartnell and S. T. Hedetniemi, An Algorithm for two Disjoint Matchings in a Tree (submitted).
3. E. J. Cockayne, S. Goodman and S. T. Hedetniemi, A Linear Algorithm for the Domination Number of a Tree, Information Processings Letters 4 (1975), 41–44.
4. E. J. Cockayne and S. T. Hedetniemi, Optimal Domination in Graphs, IEEE Trans. on Circuits and Systems, Vol. CAS-22 No. 11 (1975), 855–857.
5. E. J. Cockayne and S. T. Hedetniemi, Disjoint Independent Dominating Sets in Graphs, Discrete Math (to appear).
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献