| Graph Theory, volume 173 of R Diestel Graduate texts in mathematics 7, 2012 | 805 | 2012 |
| Graduate texts in mathematics: Graph theory R Diestel Heidelb: SpringerVerlag, 2000 | 309 | 2000 |
| Graph theory R Diestel Springer (print edition); Reinhard Diestel (eBooks), 2024 | 247 | 2024 |
| Highly connected sets and the excluded grid theorem R Diestel, TR Jensen, KY Gorbunov, C Thomassen Journal of Combinatorial Theory, Series B 75 (1), 61-73, 1999 | 193 | 1999 |
| Graph Decotnpositions: A Study in Infinite Graph Theory R Diestel Oxford university press, 1990 | 129 | 1990 |
| Graph-theoretical versus topological ends of graphs R Diestel, D Kühn Journal of Combinatorial Theory, Series B 87 (1), 197-206, 2003 | 123 | 2003 |
| Axioms for infinite matroids H Bruhn, R Diestel, M Kriesell, R Pendavingh, P Wollan Advances in Mathematics 239, 18-46, 2013 | 120 | 2013 |
| On infinite cycles I R Diestel, D Kühn Combinatorica 24, 69-89, 2004 | 111 | 2004 |
| A conjecture concerning a limit of non-Cayley graphs R Diestel, I Leader Journal of algebraic combinatorics 14, 17-25, 2001 | 109 | 2001 |
| Graph theory 3rd ed R Diestel Graduate texts in mathematics 173 (33), 12, 2005 | 108 | 2005 |
| Topological paths, cycles and spanning trees in infinite graphs R Diestel, D Kühn European Journal of Combinatorics 25 (6), 835-862, 2004 | 84 | 2004 |
| On infinite cycles II R Diestel, D Kühn Combinatorica 24, 91-116, 2004 | 82 | 2004 |
| Two short proofs concerning tree-decompositions P Bellenbaum, R Diestel Combinatorics, Probability and Computing 11 (6), 541-547, 2002 | 81 | 2002 |
| The cycle space of an infinite graph R Diestel Combinatorics, Probability and Computing 14 (1-2), 59-79, 2005 | 76 | 2005 |
| Connectivity and tree structure in finite graphs J Carmesin, R Diestel, F Hundertmark, M Stein Combinatorica 34, 11-46, 2014 | 68 | 2014 |
| Profiles of separations: in graphs, matroids, and beyond R Diestel, F Hundertmark, S Lemanczyk Combinatorica 39, 37-75, 2019 | 63 | 2019 |
| Duality in infinite graphs H Bruhn, R Diestel Combinatorics, Probability and Computing 15 (1-2), 75-90, 2006 | 57 | 2006 |
| Abstract separation systems R Diestel Order 35, 157-170, 2018 | 56 | 2018 |
| Locally finite graphs with ends: A topological approach, II. Applications R Diestel Discrete mathematics 310 (20), 2750-2765, 2010 | 51 | 2010 |
| Tangle-tree duality in abstract separation systems R Diestel, S Oum Advances in Mathematics 377, 107470, 2021 | 49 | 2021 |
