Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Diestel, Reinhard
2006.
End spaces and spanning trees.
Journal of Combinatorial Theory, Series B,
Vol. 96,
Issue. 6,
p.
846.
Georgakopoulos, Angelos
2007.
Connected but not path-connected subspaces of infinite graphs.
Combinatorica,
Vol. 27,
Issue. 6,
p.
683.
Sprüssel, Philipp
2008.
End spaces of graphs are normal.
Journal of Combinatorial Theory, Series B,
Vol. 98,
Issue. 4,
p.
798.
2008.
Nachwuchsförderung im Sport.
p.
258.
Bruhn, Henning
Kosuch, Stefanie
and
Win Myint, Melanie
2009.
Bicycles and left–right tours in locally finite graphs.
European Journal of Combinatorics,
Vol. 30,
Issue. 2,
p.
356.
Diestel, Reinhard
and
Sprüssel, Philipp
2010.
The homology of a locally finite graph with ends.
Combinatorica,
Vol. 30,
Issue. 6,
p.
681.
Diestel, Reinhard
2010.
Locally finite graphs with ends: A topological approach, II. Applications.
Discrete Mathematics,
Vol. 310,
Issue. 20,
p.
2750.
BRUHN, HENNING
and
STEIN, MAYA
2010.
Duality of Ends.
Combinatorics, Probability and Computing,
Vol. 19,
Issue. 1,
p.
47.
Bruhn, Henning
and
Diestel, Reinhard
2011.
Infinite matroids in graphs.
Discrete Mathematics,
Vol. 311,
Issue. 15,
p.
1461.
Diestel, Reinhard
and
Sprüssel, Philipp
2011.
The fundamental group of a locally finite graph with ends.
Advances in Mathematics,
Vol. 226,
Issue. 3,
p.
2643.
Diestel, Reinhard
and
Sprüssel, Philipp
2011.
On the homology of locally compact spaces with ends.
Topology and its Applications,
Vol. 158,
Issue. 13,
p.
1626.
Richter, R. Bruce
2011.
Graph-like spaces: An introduction.
Discrete Mathematics,
Vol. 311,
Issue. 15,
p.
1390.
Bruhn, Henning
and
Georgakopoulos, Agelos
2011.
Bases and closures under infinite sums.
Linear Algebra and its Applications,
Vol. 435,
Issue. 8,
p.
2007.
Diestel, Reinhard
2011.
Locally finite graphs with ends: A topological approach, I. Basic theory.
Discrete Mathematics,
Vol. 311,
Issue. 15,
p.
1423.
Bruhn, Henning
Diestel, Reinhard
Kriesell, Matthias
Pendavingh, Rudi
and
Wollan, Paul
2013.
Axioms for infinite matroids.
Advances in Mathematics,
Vol. 239,
Issue. ,
p.
18.
Miraftab, B.
and
Moghadamzadeh, M.J.
2017.
Algebraic flow theory of infinite graphs.
European Journal of Combinatorics,
Vol. 62,
Issue. ,
p.
58.
Carmesin, Johannes
2017.
Topological cycle matroids of infinite graphs.
European Journal of Combinatorics,
Vol. 60,
Issue. ,
p.
135.
Diestel, Reinhard
and
Pott, Julian
2017.
Dual trees must share their ends.
Journal of Combinatorial Theory, Series B,
Vol. 123,
Issue. ,
p.
32.
Kurkofka, Jan
2022.
Every infinitely edge-connected graph contains the Farey graph or $${T_{\aleph _0}*t}$$ as a minor.
Mathematische Annalen,
Vol. 382,
Issue. 3-4,
p.
1881.
Dovgoshey, Oleksiy
and
Küçükaslan, Mehmet
2022.
Labeled Trees Generating Complete, Compact, and Discrete Ultrametric Spaces.
Annals of Combinatorics,
Vol. 26,
Issue. 3,
p.
613.