Reinhard Diestel
-
- Limits and Structures in Graph Theory 29
- Computational Theory and Mathematics top 0.1%
- Advanced Graph Theory Research 70
- Graph Labeling and Dimension Problems 19
- Topological and Geometric Data Analysis 17
- Complexity and Algorithms in Graphs 9
- Geometry and Topology top 0.5%
- Advanced Topology and Set Theory 21
- Graph theory and applications 16
-
- Interconnection Networks and Systems 10
- Co-authors
- Daniela KühnPaul SeymourHenning BruhnAlexander SchrijverImre LeaderCarsten ThomassenTommy R. JensenK. Yu. Gorbunov
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Journals
- Transactions of the American Mathematical Society (2 papers)Inventiones mathematicae (1 paper)American Mathematical Monthly (4 papers)
- Partner nations
- GermanyUnited KingdomUnited States
In The Last Decade
Reinhard Diestel
95 papers receiving 4.5k citations
Hit Papers
Peers
Comparison fields: 5 of 157
- Discrete Mathematics and Combinatorics 960
- Computational Theory and Mathematics 2.7k
- Geometry and Topology 1.1k
- Computer Graphics and Computer-Aided Design 249
- Computer Networks and Communications 1.1k
Countries citing papers authored by Reinhard Diestel
This map shows the geographic impact of Reinhard Diestel's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Reinhard Diestel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Reinhard Diestel more than expected).
Fields of papers citing papers by Reinhard Diestel
This network shows the impact of papers produced by Reinhard Diestel. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Reinhard Diestel. The network helps show where Reinhard Diestel may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Reinhard Diestel, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2017 | 10 | |
| 2 | 2016 | 5 | |
| 3 | 2015 | 6 | |
| 4 | 2015 | 9 | |
| 5 | 2015 | 0 | |
| 6 | Forcing k-blocks in graphs by minimum and average degree conditions | 2013 | 2 |
| 7 | 2011 | 9 | |
| 8 | 2011 | 14 | |
| 9 | 2011 | 7 | |
| 10 | 2008 | 7 | |
| 11 | 2008 | 5 | |
| 12 | 2004 | 1 | |
| 13 | 2004 | 12 | |
| 14 | 1999 | 10 | |
| 15 | 1994 | 4 | |
| 16 | 1994 | 4 | |
| 17 | Directions in infinite graph theory and combinatorics | 1992 | 6 |
| 18 | 1992 | 14 | |
| 19 | 1985 | 4 | |
| 20 | 1985 | 3 |
About Reinhard Diestel
Reinhard Diestel is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 96 papers that have together received 4.8k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (70 papers), Limits and Structures in Graph Theory (29 papers), Advanced Topology and Set Theory (21 papers), Graph Labeling and Dimension Problems (19 papers), Topological and Geometric Data Analysis (17 papers), Graph theory and applications (16 papers), Interconnection Networks and Systems (10 papers) and Complexity and Algorithms in Graphs (9 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (960 citations), Computational Theory and Mathematics (2.7k citations) and Geometry and Topology (1.1k citations). Reinhard Diestel has collaborated with scholars based in Germany, United Kingdom and United States. Frequent co-authors include Daniela Kühn, Paul Seymour, Henning Bruhn, Alexander Schrijver, Imre Leader, Carsten Thomassen, Tommy R. Jensen, K. Yu. Gorbunov, Maya Stein and Paul Wollan. Their work appears in journals such as Transactions of the American Mathematical Society, Inventiones mathematicae and American Mathematical Monthly.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.