Some remarks on universal graphs. - Reinhard Diestel; Rudolf Halin; Walter Vogler (Comb., 1985)

On the problem of finding small subdivision and homomorphism bases for classes of countable graphs. - Reinhard Diestel (Discret. Math., 1985)

On Universal Graphs With Forbidden Topological Subgraphs. - Reinhard Diestel (Eur. J. Comb., 1985)

Simplicial decompositions of graphs - Some uniqueness results. - Reinhard Diestel (J. Comb. Theory B, 1987)

A separation property of planar triangulations. - Reinhard Diestel (J. Graph Theory, 1987)

Tree-decompositions, tree-representability and chordal graphs. - Reinhard Diestel (Discret. Math., 1988)

Simplicial decompositions of graphs: a survey of applications. - Reinhard Diestel (Discret. Math., 1989)

Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions. - Reinhard Diestel (J. Comb. Theory B, 1990)

Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions. - Reinhard Diestel (J. Comb. Theory B, 1990)

Simplicial tree-decompositions of infinite graphs, I. - Reinhard Diestel (J. Comb. Theory B, 1990)

Dominating functions and topological graph minors. - Reinhard Diestel (Graph Structure Theory, 1991)

Preface. - Reinhard Diestel (Discret. Math., 1991)

Decomposing infinite graphs. - Reinhard Diestel (Discret. Math., 1991)

The end structure of a graph: recent results and open problems. - Reinhard Diestel (Discret. Math., 1992)

On spanning trees and k-connectedness in infinite graphs. - Reinhard Diestel (J. Comb. Theory B, 1992)

The structure of TKa-free graphs. - Reinhard Diestel (J. Comb. Theory B, 1992)

Menger's Theorem for a Countable Source Set. - Ron Aharoni; Reinhard Diestel (Comb. Probab. Comput., 1994)

The Growth of Infinite Graphs: Boundedness and Finite Spreading. - Reinhard Diestel; Imre Leader (Comb. Probab. Comput., 1994)

The Depth-First Search Tree Structure of TKaleph0-Free Graphs. - Reinhard Diestel (J. Comb. Theory B, 1994)

Domination Games on Infinite Graphs. - Reinhard Diestel; Imre Leader (Theor. Comput. Sci., 1994)

Graph Minors 1: A Short Proof of the Path-width Theorem. - Reinhard Diestel (Comb. Probab. Comput., 1995)

Highly Connected Sets and the Excluded Grid Theorem. - Reinhard Diestel; Tommy R. Jensen; Konstantin Yu. Gorbunov; Carsten Thomassen (J. Comb. Theory B, 1999)

Excluding a Countable Clique. - Reinhard Diestel; Robin Thomas 001 (J. Comb. Theory B, 1999)

A universal planar graph under the minor relation. - Reinhard Diestel; Daniela Kühn (J. Graph Theory, 1999)

An accessibility theorem for infinite graph minors. - Reinhard Diestel (J. Graph Theory, 2000)

Relating Subsets of a Poset, and a Partition Theorem for WQOs. - Reinhard Diestel (Order, 2001)

Two Short Proofs Concerning Tree-Decompositions. - Patrick Bellenbaum; Reinhard Diestel (Comb. Probab. Comput., 2002)

The countable Erds-Menger conjecture with ends. - Reinhard Diestel (J. Comb. Theory B, 2003)

Graph-theoretical versus topological ends of graphs. - Reinhard Diestel; Daniela Kühn (J. Comb. Theory B, 2003)

On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets. - Reinhard Diestel; Oleg Pikhurko (Order, 2003)

On Infinite Cycles I. - Reinhard Diestel; Daniela Kühn (Comb., 2004)

On Infinite Cycles II. - Reinhard Diestel; Daniela Kühn (Comb., 2004)

Dense Minors In Graphs Of Large Girth. - Reinhard Diestel; Christof Rempel (Comb., 2004)

Topological paths, cycles and spanning trees in infinite graphs. - Reinhard Diestel; Daniela Kühn (Eur. J. Comb., 2004)

On Infinite Cycles in Graphs: Or How to Make Graph Homology Interesting. - Reinhard Diestel (Am. Math. Mon., 2004)

The Cycle Space of an Infinite Graph. - Reinhard Diestel (Comb. Probab. Comput., 2005)

Graph minor hierarchies. - Reinhard Diestel; Daniela Kühn (Discret. Appl. Math., 2005)

The Erdös-Menger conjecture for source/sink sets with disjoint closures. - Reinhard Diestel (J. Comb. Theory B, 2005)

Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. - Henning Bruhn; Reinhard Diestel; Maya Stein (J. Graph Theory, 2005)

Menger's theorem for infinite graphs with ends. - Henning Bruhn; Reinhard Diestel; Maya Stein (J. Graph Theory, 2005)

Graphentheorie (3. Aufl.). - Reinhard Diestel (Springer, 2006)

Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. - Stephan Brandt; Hajo Broersma; Reinhard Diestel; Matthias Kriesell (Comb., 2006)

Duality in Infinite Graphs. - Henning Bruhn; Reinhard Diestel (Comb. Probab. Comput., 2006)

End spaces and spanning trees. - Reinhard Diestel (J. Comb. Theory B, 2006)

A Cantor-Bernstein Theorem for Paths in Graphs. - Reinhard Diestel; Carsten Thomassen (Am. Math. Mon., 2006)

Every rayless graph has an unfriendly partition. - Henning Bruhn; Reinhard Diestel; Agelos Georgakopoulos; Philipp Sprüssel (Electron. Notes Discret. Math., 2009)

MacLane's theorem for arbitrary surfaces. - Henning Bruhn; Reinhard Diestel (J. Comb. Theory B, 2009)

The homology of a locally finite graph with ends. - Reinhard Diestel; Philipp Sprüssel (Comb., 2010)

Locally finite graphs with ends: A topological approach, II. Applications. - Reinhard Diestel (Discret. Math., 2010)

Infinite matroids in graphs. - Henning Bruhn; Reinhard Diestel (Discret. Math., 2011)

Locally finite graphs with ends: A topological approach, I. Basic theory. - Reinhard Diestel (Discret. Math., 2011)

Decomposing infinite matroids into their 3-connected minors. - Elad Aigner-Horev; Reinhard Diestel; Luke Postle (Electron. Notes Discret. Math., 2011)

Twins of rayless graphs. - Anthony Bonato; Henning Bruhn; Reinhard Diestel; Philipp Sprüssel (J. Comb. Theory B, 2011)

Graph Theory, 4th Edition. - Reinhard Diestel (Springer, 2012)

Locally finite graphs with ends: A topological approach, III. Fundamental group and homology. - Reinhard Diestel; Philipp Sprüssel (Discret. Math., 2012)

On the excluded minor structure theorem for graphs of large tree-width. - Reinhard Diestel; Ken-ichi Kawarabayashi; Theodor Müller; Paul Wollan (J. Comb. Theory B, 2012)

The Erdős-Pósa property for clique minors in highly connected graphs. - Reinhard Diestel; Ken-ichi Kawarabayashi; Paul Wollan (J. Comb. Theory B, 2012)

Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract). - Reinhard Diestel; Sang-il Oum (WG, 2014)

Connectivity and tree structure in finite graphs. - Johannes Carmesin; Reinhard Diestel; Fabian Hundertmark; Maya Stein (Comb., 2014)

Orthogonality and Minimality in the Homology of Locally Finite Graphs. - Reinhard Diestel; Julian Pott (Electron. J. Comb., 2014)

k-Blocks: A Connectivity Invariant for Graphs. - Johannes Carmesin; Reinhard Diestel; Matthias Hamann; Fabian Hundertmark (SIAM J. Discret. Math., 2014)

Forcing Finite Minors in Sparse Infinite Graphs by Large-Degree Assumptions. - Reinhard Diestel (Electron. J. Comb., 2015)

A Simple Existence Criterion for Normal Spanning Trees. - Reinhard Diestel (Electron. J. Comb., 2016)

Tangles and the Mona Lisa. - Reinhard Diestel; Geoff Whittle (CoRR, 2016)

The structure of 2-separations of infinite matroids. - Elad Aigner-Horev; Reinhard Diestel; Luke Postle (J. Comb. Theory B, 2016)

Canonical tree-decompositions of finite graphs I. Existence and algorithms. - Johannes Carmesin; Reinhard Diestel; Matthias Hamann; Fabian Hundertmark (J. Comb. Theory B, 2016)

Canonical tree-decompositions of finite graphs II. Essential parts. - Johannes Carmesin; Reinhard Diestel; Matthias Hamann; Fabian Hundertmark (J. Comb. Theory B, 2016)

Dual trees must share their ends. - Reinhard Diestel; Julian Pott (J. Comb. Theory B, 2017)

Duality Theorems for Blocks and Tangles in Graphs. - Reinhard Diestel; Philipp Eberenz; Joshua Erde (SIAM J. Discret. Math., 2017)

Connected Tree-Width. - Reinhard Diestel; Malte Müller (Comb., 2018)

Abstract Separation Systems. - Reinhard Diestel (Order, 2018)

Tree Sets. - Reinhard Diestel (Order, 2018)

Profiles of Separations: in Graphs, Matroids, and Beyond. - Reinhard Diestel; Fabian Hundertmark; Sahar Lemanczyk (Comb., 2019)

Tangle-Tree Duality: In Graphs, Matroids and Beyond. - Reinhard Diestel; Sang-il Oum (Comb., 2019)

Tangles in the social sciences. - Reinhard Diestel (CoRR, 2019)

Structural submodularity and tangles in abstract separation systems. - Reinhard Diestel; Joshua Erde; Daniel Weißauer (J. Comb. Theory A, 2019)

Tangles: a new paradigm for clusters and types. - Reinhard Diestel (CoRR, 2020)

Profinite Separation Systems. - Reinhard Diestel; Jakob Kneip (Order, 2020)