Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Diestel, Reinhard
2005.
The Erdős–Menger conjecture for source/sink sets with disjoint closures.
Journal of Combinatorial Theory, Series B,
Vol. 93,
Issue. 1,
p.
107.
Bruhn, Henning
Diestel, Reinhard
and
Stein, Maya
2005.
Menger's theorem for infinite graphs with ends.
Journal of Graph Theory,
Vol. 50,
Issue. 3,
p.
199.
Bruhn, Henning
Diestel, Reinhard
and
Stein, Maya
2005.
Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs.
Journal of Graph Theory,
Vol. 50,
Issue. 2,
p.
150.
Georgakopoulos, A.
2006.
Infinite highly connected planar graphs of large girth.
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg,
Vol. 76,
Issue. 1,
p.
235.
Bruhn, Henning
and
Stein, Maya
2006.
MacLane's planarity criterion for locally finite graphs.
Journal of Combinatorial Theory, Series B,
Vol. 96,
Issue. 2,
p.
225.
Diestel, Reinhard
2006.
End spaces and spanning trees.
Journal of Combinatorial Theory, Series B,
Vol. 96,
Issue. 6,
p.
846.
Jakobine Stein, Maya
2006.
Arboricity and tree-packing in locally finite graphs.
Journal of Combinatorial Theory, Series B,
Vol. 96,
Issue. 2,
p.
302.
Stein, Maya Jakobine
2007.
Forcing highly connected subgraphs.
Journal of Graph Theory,
Vol. 54,
Issue. 4,
p.
331.
Georgakopoulos, Angelos
2007.
Connected but not path-connected subspaces of infinite graphs.
Combinatorica,
Vol. 27,
Issue. 6,
p.
683.
Bruhn, Henning
and
Stein, Maya
2007.
On end degrees and infinite cycles in locally finite graphs.
Combinatorica,
Vol. 27,
Issue. 3,
p.
269.
Casteels, Karel
and
Richter, R. Bruce
2008.
The bond and cycle spaces of an infinite graph.
Journal of Graph Theory,
Vol. 59,
Issue. 2,
p.
162.
Maney, Jack
2008.
Irreducible Divisor Graphs II.
Communications in Algebra,
Vol. 36,
Issue. 9,
p.
3496.
Vella, Antoine
and
Richter, R. Bruce
2008.
Cycle spaces in topological spaces.
Journal of Graph Theory,
Vol. 59,
Issue. 2,
p.
115.
Yu, Xingxing
2008.
Infinite paths in planar graphs V, 3‐indivisible graphs.
Journal of Graph Theory,
Vol. 57,
Issue. 4,
p.
275.
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.
Cui, Qing
Wang, Jian
and
Yu, Xingxing
2009.
Hamilton circles in infinite planar graphs.
Journal of Combinatorial Theory, Series B,
Vol. 99,
Issue. 1,
p.
110.
Georgakopoulos, Agelos
2009.
A short proof of Fleischner’s theorem.
Discrete Mathematics,
Vol. 309,
Issue. 23-24,
p.
6632.
Georgakopoulos, Agelos
2009.
Infinite Hamilton cycles in squares of locally finite graphs.
Advances in Mathematics,
Vol. 220,
Issue. 3,
p.
670.
BRUHN, HENNING
and
STEIN, MAYA
2010.
Duality of Ends.
Combinatorics, Probability and Computing,
Vol. 19,
Issue. 1,
p.
47.
Diestel, Reinhard
and
Sprüssel, Philipp
2010.
The homology of a locally finite graph with ends.
Combinatorica,
Vol. 30,
Issue. 6,
p.
681.