Author:
Courcelle B.,Makowsky J.A.,Rotics U.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference74 articles.
1. Complexity of finding embedding in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987
2. Easy problems for tree decomposable graphs;Arnborg;J. Algorithms,1991
3. Recognition and isomorphism of tree-like P4-connected graphs;Babel;Discrete Appl. Math.,2000
4. On the isomorphism of graphs with few P4s;Babel,1995
5. On the p-connectedness of graphs — a survey;Babel;Discrete Appl. Math.,1999
Cited by
137 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献