Author:
Hahn Geňa,Laviolette François,Širáň Jozef
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. The end structure of a graph: Recent results and open problems;Diestel;Discrete Math.,1992
2. R. Diestel, Strongly end-faithful spanning trees in countable graphs, University of Cambridge
3. Über unendliche Wege in Graphen;Halin;Math. Ann.,1964
4. F. Laviolette, N. Polat, 1995, Spanning trees of countable graphs omitting sets of dominated ends, Université de Montréal
5. Développements terminaux des graphes infinis. III. Arbres maximaux sans rayon. Cardinalité maximum des ensembles disjoints de rayons;Polat;Math. Nachr.,1984
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献