Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. Graph Theory;Diestel,2000
2. On well-quasi-ordering infinite trees;Nash-Williams;Proc. Cambridge Philos. Soc.,1965
3. A glance at graph theory—Part II;Nash-Williams;Bull. London Math. Soc.,1982
4. N. Robertson, P.D. Seymour, Graph Minors XX. Wagner's conjecture, preprint.
5. A counter-example to ‘Wagner's conjecture’ for infinite graphs;Thomas;Math. Proc. Cambridge Philos. Soc.,1988
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献