Author:
Laviolette François,Polat Norbert
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference19 articles.
1. Topologie générale;Bourbaki,1958
2. R. Diestel, Strongly end-faithful spanning trees in countable graphs, Preprint, University of Cambridge.
3. The end structure of a graph: recent results and open problems;Diestel;Discrete Math.,1992
4. Über die Enden diskreter Räume und Gruppen;Freudenthal;Comment. Math. Helv.,1944
5. Über unendliche Wege in Graphen;Halin;Math. Ann.,1964
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献