Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference28 articles.
1. Efficient algorithms for combinatorial problems with bounded decomposability-a survey;Arnborg;BIT,1985
2. Complexity of finding embeddings in a k-tree;Amborg;SIAM J. Algebraic Discrete Methods,1987
3. On the P4-structure of graphs, Habilitationsschrift, Zentrum Mathematik;Babel,1997
4. On the structure of graphs with few P4s;Babel;Discrete Appl. Math.,1998
5. L. Babel, S. Olariu, Domination and Steiner tree problems on graphs with few P4s, in: Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG'98, Lecture Notes in Computer Science, Springer, Berlin, to appear.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献