1. Menger’s theorem for countable graphs;Aharoni;J. Combin. Theory B,1987
2. R. Aharoni, E. Berger, Menger’s theorem for infinite graphs, Invent. Math. (in press).
3. R. Aharoni, E. Berger, A. Georgakopoulos, A. Perlstein, P. Sprüssel, The max-flow min-cut theorem for countable networks, J. Combin. Theory B (in press).
4. Infinite highly connected digraphs with no two arc-disjoint spanning trees;Aharoni;J. Graph Theory,1989
5. An algebraic characterization of planar graphs;Archdeacon;J. Graph Theory,1995