Author:
Robertson Neil,Seymour Paul
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference3 articles.
1. C. St. J. A. Nash-Williams, On well-quasi-ordering trees, Theory of Graphs and its Applications (Proc. Symp. Smolenice, 1963), Publ. House Czechoslovak Acad. Sci., 1964, pp. 83–84.
2. Graph Minors. IV. Tree-width and well-quasi-ordering;Robertson;J. Combin. Theory Ser. B,1990
3. Graph Minors. X. Obstructions to tree-decomposition;Robertson;J. Combin. Theory Ser. B,1991
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献