Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference30 articles.
1. E. Berger and H. Bruhn: Eulerian edge sets in locally finite graphs, Combinatorica
31 (2011), 21–38.
2. N. Bowler and J. Carmesin: Infinite matroids and determinacy of games, Preprint 2013, current version available at http://arxiv.org/abs/1301.5980.
3. H. Bruhn and M. Stein: On end degrees and infinite circuits in locally finite graphs, Combinatorica
27 (2007), 269–291.
4. C. Carathéodory: Über die Begrenzung einfach zusammenhängender Gebiete, Math. Ann.
73 (1913), 323–370.
5. J. Carmesin: All graphs have tree-decompositions displaying their topological ends, Preprint 2015, available at http://arxiv.org/pdf/1409.6640v4.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Entanglements;Journal of Combinatorial Theory, Series B;2024-01
2. End spaces and tree-decompositions;Journal of Combinatorial Theory, Series B;2023-07
3. A tree-of-tangles theorem for infinite tangles;Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg;2022-10
4. Constructing Tree-Decompositions That Display All Topological Ends;Combinatorica;2022-10
5. Duality theorems for stars and combs IV: Undominating stars;Journal of Graph Theory;2022-01-17