Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference5 articles.
1. J. Bruno, P. Szeptycki, On families of toplogical locally finite trees, in preparation
2. Graph Theory;Diestel,2005
3. On well-quasi-ordering infinite trees—Nash-Williams’s theorem revisited;Kühn;Math. Proc. Cambridge Philos. Soc.,2001
4. There are uncountably many topological types of locally finite trees;Matthiesen;J. Combin. Theory Ser. B,2006
5. On well-quasi-ordering infinite trees;Nash-Williams;Proc. Cambridge Philos. Soc.,1965
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献