Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference31 articles.
1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Meth.,1987
2. H. Balakrishnan, R. Rajaraman, C. Pandu Rangan, Connected domination and Steiner set on asteroidal triple-free graphs, Proceedings of WADS’93, Lecture Notes in Computer Science, vol. 709, Springer, Berlin, 1993, pp. 131–141.
3. A. Brandstädt, Special graph classes — a survey, Schriftenreihe des Fachbereichs Mathematik, SM-DU-199, Universität Duisburg Gesamthochschule, 1991.
4. A. Brandstädt, V.D. Chepoi, F.F. Dragan, The algorithmic use of hypertree structure and maximum neighbourhood orderings, Proceedings of WG’94, Lecture Notes in Computer Science, vol. 903, Springer, Berlin, 1995, pp. 65–80.
5. H. Breu, D.G. Kirkpatrick, Algorithms for dominating and Steiner set problems in cocomparability graphs, manuscript, 1993.
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Asteroidal Sets and Dominating Paths;Combinatorial Optimization and Applications;2023-12-09
2. Connected Feedback VertexSet on AT-Free Graphs;Lecture Notes in Computer Science;2023
3. Complexity of paired domination in AT-free and planar graphs;Theoretical Computer Science;2022-09
4. Induced Disjoint Paths in AT-free graphs;Journal of Computer and System Sciences;2022-03
5. Complexity of Paired Domination in AT-free and Planar Graphs;Algorithms and Discrete Applied Mathematics;2022