default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReinhard Diestel
Person information
- affiliation: Hamburg University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j72]Reinhard Diestel
, Jakob Kneip:
Profinite Separation Systems. Order 37(1): 179-205 (2020)- [i4]Reinhard Diestel:
Tangles: a new paradigm for clusters and types. CoRR abs/2006.01830 (2020)
2010 – 2019
- 2019
- [j71]Reinhard Diestel, Fabian Hundertmark, Sahar Lemanczyk:
Profiles of Separations: in Graphs, Matroids, and Beyond. Comb. 39(1): 37-75 (2019) - [j70]Reinhard Diestel, Sang-il Oum:
Tangle-Tree Duality: In Graphs, Matroids and Beyond. Comb. 39(4): 879-910 (2019) - [j69]Reinhard Diestel, Joshua Erde, Daniel Weißauer:
Structural submodularity and tangles in abstract separation systems. J. Comb. Theory A 167: 155-180 (2019) - [i3]Reinhard Diestel:
Tangles in the social sciences. CoRR abs/1907.07341 (2019) - 2018
- [j68]Reinhard Diestel, Malte Müller:
Connected Tree-Width. Comb. 38(2): 381-398 (2018) - [j67]Reinhard Diestel:
Abstract Separation Systems. Order 35(1): 157-170 (2018) - [j66]Reinhard Diestel:
Tree Sets. Order 35(1): 171-192 (2018) - 2017
- [j65]Reinhard Diestel, Julian Pott:
Dual trees must share their ends. J. Comb. Theory B 123: 32-53 (2017) - [j64]Reinhard Diestel, Philipp Eberenz, Joshua Erde:
Duality Theorems for Blocks and Tangles in Graphs. SIAM J. Discret. Math. 31(3): 1514-1528 (2017) - 2016
- [j63]Reinhard Diestel:
A Simple Existence Criterion for Normal Spanning Trees. Electron. J. Comb. 23(2): 2 (2016) - [j62]Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark:
Canonical tree-decompositions of finite graphs I. Existence and algorithms. J. Comb. Theory B 116: 1-24 (2016) - [j61]Elad Aigner-Horev, Reinhard Diestel, Luke Postle:
The structure of 2-separations of infinite matroids. J. Comb. Theory B 116: 25-56 (2016) - [j60]Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark:
Canonical tree-decompositions of finite graphs II. Essential parts. J. Comb. Theory B 118: 268-283 (2016) - [i2]Reinhard Diestel, Geoff Whittle:
Tangles and the Mona Lisa. CoRR abs/1603.06652 (2016) - 2015
- [j59]Reinhard Diestel:
Forcing Finite Minors in Sparse Infinite Graphs by Large-Degree Assumptions. Electron. J. Comb. 22(1): 1 (2015) - 2014
- [j58]Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark, Maya Stein:
Connectivity and tree structure in finite graphs. Comb. 34(1): 11-46 (2014) - [j57]Reinhard Diestel, Julian Pott:
Orthogonality and Minimality in the Homology of Locally Finite Graphs. Electron. J. Comb. 21(3): 3 (2014) - [j56]Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark:
k-Blocks: A Connectivity Invariant for Graphs. SIAM J. Discret. Math. 28(4): 1876-1891 (2014) - [c2]Reinhard Diestel, Sang-il Oum:
Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract). WG 2014: 1-14 - 2012
- [b2]Reinhard Diestel:
Graph Theory, 4th Edition. Graduate texts in mathematics 173, Springer 2012, ISBN 978-3-642-14278-9, pp. I-XVIII, 1-436 - [j55]Reinhard Diestel, Philipp Sprüssel:
Locally finite graphs with ends: A topological approach, III. Fundamental group and homology. Discret. Math. 312(1): 21-29 (2012) - [j54]Reinhard Diestel, Ken-ichi Kawarabayashi, Paul Wollan:
The Erdős-Pósa property for clique minors in highly connected graphs. J. Comb. Theory B 102(2): 454-469 (2012) - [j53]Reinhard Diestel, Ken-ichi Kawarabayashi, Theodor Müller, Paul Wollan:
On the excluded minor structure theorem for graphs of large tree-width. J. Comb. Theory B 102(6): 1189-1210 (2012) - [i1]Reinhard Diestel, Malte Müller:
Connected tree-width. CoRR abs/1211.7353 (2012) - 2011
- [j52]Reinhard Diestel:
Locally finite graphs with ends: A topological approach, I. Basic theory. Discret. Math. 311(15): 1423-1447 (2011) - [j51]Henning Bruhn, Reinhard Diestel:
Infinite matroids in graphs. Discret. Math. 311(15): 1461-1471 (2011) - [j50]Elad Aigner-Horev, Reinhard Diestel, Luke Postle:
Decomposing infinite matroids into their 3-connected minors. Electron. Notes Discret. Math. 38: 11-16 (2011) - [j49]Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel:
Twins of rayless graphs. J. Comb. Theory B 101(1): 60-65 (2011) - 2010
- [j48]Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel:
Every rayless graph has an unfriendly partition. Comb. 30(5): 521-532 (2010) - [j47]Reinhard Diestel, Philipp Sprüssel:
The homology of a locally finite graph with ends. Comb. 30(6): 681-714 (2010) - [j46]Reinhard Diestel:
Locally finite graphs with ends: A topological approach, II. Applications. Discret. Math. 310(20): 2750-2765 (2010)
2000 – 2009
- 2009
- [j45]Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel:
Every rayless graph has an unfriendly partition. Electron. Notes Discret. Math. 34: 279-281 (2009) - [j44]Henning Bruhn, Reinhard Diestel:
MacLane's theorem for arbitrary surfaces. J. Comb. Theory B 99(2): 275-286 (2009) - 2006
- [b1]Reinhard Diestel:
Graphentheorie (3. Aufl.). Springer 2006, ISBN 978-3-540-21391-8, pp. I-XVI, 1-344 - [j43]Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell:
Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. Comb. 26(1): 17-36 (2006) - [j42]Henning Bruhn, Reinhard Diestel:
Duality in Infinite Graphs. Comb. Probab. Comput. 15(1-2): 75-90 (2006) - [j41]Reinhard Diestel:
End spaces and spanning trees. J. Comb. Theory B 96(6): 846-854 (2006) - [j40]Reinhard Diestel, Carsten Thomassen:
A Cantor-Bernstein Theorem for Paths in Graphs. Am. Math. Mon. 113(2): 161-165 (2006) - 2005
- [j39]Reinhard Diestel:
The Cycle Space of an Infinite Graph. Comb. Probab. Comput. 14(1-2): 59-79 (2005) - [j38]Reinhard Diestel, Daniela Kühn:
Graph minor hierarchies. Discret. Appl. Math. 145(2): 167-182 (2005) - [j37]Reinhard Diestel:
The Erdös-Menger conjecture for source/sink sets with disjoint closures. J. Comb. Theory B 93(1): 107-114 (2005) - [j36]Henning Bruhn, Reinhard Diestel, Maya Stein:
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. J. Graph Theory 50(2): 150-161 (2005) - [j35]Henning Bruhn, Reinhard Diestel, Maya Stein:
Menger's theorem for infinite graphs with ends. J. Graph Theory 50(3): 199-211 (2005) - 2004
- [j34]Reinhard Diestel, Daniela Kühn:
On Infinite Cycles I. Comb. 24(1): 69-89 (2004) - [j33]Reinhard Diestel, Daniela Kühn:
On Infinite Cycles II. Comb. 24(1): 91-116 (2004) - [j32]Reinhard Diestel, Christof Rempel:
Dense Minors In Graphs Of Large Girth. Comb. 25(1): 111-116 (2004) - [j31]Reinhard Diestel, Daniela Kühn:
Topological paths, cycles and spanning trees in infinite graphs. Eur. J. Comb. 25(6): 835-862 (2004) - [j30]Reinhard Diestel:
On Infinite Cycles in Graphs: Or How to Make Graph Homology Interesting. Am. Math. Mon. 111(7): 559-571 (2004) - 2003
- [j29]Reinhard Diestel:
The countable Erds-Menger conjecture with ends. J. Comb. Theory B 87(1): 145-161 (2003) - [j28]Reinhard Diestel, Daniela Kühn:
Graph-theoretical versus topological ends of graphs. J. Comb. Theory B 87(1): 197-206 (2003) - [j27]Reinhard Diestel, Oleg Pikhurko:
On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets. Order 20(1): 53-66 (2003) - 2002
- [j26]Patrick Bellenbaum, Reinhard Diestel:
Two Short Proofs Concerning Tree-Decompositions. Comb. Probab. Comput. 11(6): 541-547 (2002) - 2001
- [j25]Reinhard Diestel:
Relating Subsets of a Poset, and a Partition Theorem for WQOs. Order 18(3): 275-279 (2001) - 2000
- [j24]Reinhard Diestel:
An accessibility theorem for infinite graph minors. J. Graph Theory 35(4): 273-277 (2000)
1990 – 1999
- 1999
- [j23]Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, Carsten Thomassen:
Highly Connected Sets and the Excluded Grid Theorem. J. Comb. Theory B 75(1): 61-73 (1999) - [j22]Reinhard Diestel, Robin Thomas:
Excluding a Countable Clique. J. Comb. Theory B 76(1): 41-67 (1999) - [j21]Reinhard Diestel, Daniela Kühn:
A universal planar graph under the minor relation. J. Graph Theory 32(2): 191-206 (1999) - 1995
- [j20]Reinhard Diestel:
Graph Minors 1: A Short Proof of the Path-width Theorem. Comb. Probab. Comput. 4: 27-30 (1995) - 1994
- [j19]Reinhard Diestel, Imre Leader:
The Growth of Infinite Graphs: Boundedness and Finite Spreading. Comb. Probab. Comput. 3: 51-55 (1994) - [j18]Ron Aharoni, Reinhard Diestel:
Menger's Theorem for a Countable Source Set. Comb. Probab. Comput. 3: 145-156 (1994) - [j17]Reinhard Diestel:
The Depth-First Search Tree Structure of TKaleph0-Free Graphs. J. Comb. Theory B 61(2): 260-262 (1994) - [j16]Reinhard Diestel, Imre Leader:
Domination Games on Infinite Graphs. Theor. Comput. Sci. 132(2): 337-345 (1994) - 1992
- [j15]Reinhard Diestel:
The end structure of a graph: recent results and open problems. Discret. Math. 100(1-3): 313-327 (1992) - [j14]Reinhard Diestel:
The structure of TKa-free graphs. J. Comb. Theory B 54(2): 222-238 (1992) - [j13]Reinhard Diestel:
On spanning trees and k-connectedness in infinite graphs. J. Comb. Theory B 56(2): 263-277 (1992) - 1991
- [j12]Reinhard Diestel:
Preface. Discret. Math. 95(1-3): 1 (1991) - [j11]Reinhard Diestel:
Decomposing infinite graphs. Discret. Math. 95(1-3): 69-89 (1991) - [c1]Reinhard Diestel:
Dominating functions and topological graph minors. Graph Structure Theory 1991: 461-476 - 1990
- [j10]Reinhard Diestel:
Simplicial tree-decompositions of infinite graphs, I. J. Comb. Theory B 48(2): 197-215 (1990) - [j9]Reinhard Diestel:
Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions. J. Comb. Theory B 50(1): 93-116 (1990) - [j8]Reinhard Diestel:
Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions. J. Comb. Theory B 50(1): 117-128 (1990)
1980 – 1989
- 1989
- [j7]Reinhard Diestel:
Simplicial decompositions of graphs: a survey of applications. Discret. Math. 75(1-3): 121-144 (1989) - 1988
- [j6]Reinhard Diestel:
Tree-decompositions, tree-representability and chordal graphs. Discret. Math. 71(2): 181-184 (1988) - 1987
- [j5]Reinhard Diestel:
Simplicial decompositions of graphs - Some uniqueness results. J. Comb. Theory B 42(2): 133-145 (1987) - [j4]Reinhard Diestel:
A separation property of planar triangulations. J. Graph Theory 11(1): 43-52 (1987) - 1985
- [j3]Reinhard Diestel, Rudolf Halin, Walter Vogler:
Some remarks on universal graphs. Comb. 5(4): 283-293 (1985) - [j2]Reinhard Diestel:
On the problem of finding small subdivision and homomorphism bases for classes of countable graphs. Discret. Math. 55(1): 21-33 (1985) - [j1]Reinhard Diestel:
On Universal Graphs With Forbidden Topological Subgraphs. Eur. J. Comb. 6(2): 175-182 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-05 20:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
