Reinhard Diestel

81 papers B 1Journal 77Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
A Grid Theorem for Strong Immersions of Walls.
J. Graph Theory
Reinhard Diestel, Raphael W. Jacobs, Paul Knappe, Paul Wollan
2020 J jnl
Profinite Separation Systems.
Order
Reinhard Diestel, Jakob Kneip
2020 J jnl
Tangles: a new paradigm for clusters and types.
CoRR
Reinhard Diestel
2019 J jnl
Profiles of Separations: in Graphs, Matroids, and Beyond.
Comb.
Reinhard Diestel, Fabian Hundertmark, Sahar Lemanczyk
2019 J jnl
Structural submodularity and tangles in abstract separation systems.
J. Comb. Theory A
Reinhard Diestel, Joshua Erde, Daniel Weißauer
2019 J jnl
Tangle-Tree Duality: In Graphs, Matroids and Beyond.
Comb.
Reinhard Diestel, Sang-il Oum
2019 J jnl
Tangles in the social sciences.
CoRR
Reinhard Diestel
2018 J jnl
Abstract Separation Systems.
Order
Reinhard Diestel
2018 J jnl
Connected Tree-Width.
Comb.
Reinhard Diestel, Malte Müller
2018 J jnl
Tree Sets.
Order
Reinhard Diestel
2017 J jnl
Dual trees must share their ends.
J. Comb. Theory B
Reinhard Diestel, Julian Pott
2017 J jnl
Duality Theorems for Blocks and Tangles in Graphs.
SIAM J. Discret. Math.
Reinhard Diestel, Philipp Eberenz, Joshua Erde
2016 J jnl
A Simple Existence Criterion for Normal Spanning Trees.
Electron. J. Comb.
Reinhard Diestel
2016 J jnl
Canonical tree-decompositions of finite graphs I. Existence and algorithms.
J. Comb. Theory B
Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark
2016 J jnl
Canonical tree-decompositions of finite graphs II. Essential parts.
J. Comb. Theory B
Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark
2016 J jnl
Tangles and the Mona Lisa.
CoRR
Reinhard Diestel, Geoff Whittle
2016 J jnl
The structure of 2-separations of infinite matroids.
J. Comb. Theory B
Elad Aigner-Horev, Reinhard Diestel, Luke Postle
2015 J jnl
Forcing Finite Minors in Sparse Infinite Graphs by Large-Degree Assumptions.
Electron. J. Comb.
Reinhard Diestel
2014 J jnl
Connectivity and tree structure in finite graphs.
Comb.
Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark, Maya Stein
2014 J jnl
Orthogonality and Minimality in the Homology of Locally Finite Graphs.
Electron. J. Comb.
Reinhard Diestel, Julian Pott
2014 B conf
Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract).
WG
Reinhard Diestel, Sang-il Oum
2014 J jnl
k-Blocks: A Connectivity Invariant for Graphs.
SIAM J. Discret. Math.
Johannes Carmesin, Reinhard Diestel, Matthias Hamann, Fabian Hundertmark
2012 J jnl
Connected tree-width.
CoRR
Reinhard Diestel, Malte Müller
2012 — book
Graph Theory, 4th Edition.
Reinhard Diestel
2012 J jnl
Locally finite graphs with ends: A topological approach, III. Fundamental group and homology.
Discret. Math.
Reinhard Diestel, Philipp Sprüssel
2012 J jnl
On the excluded minor structure theorem for graphs of large tree-width.
J. Comb. Theory B
Reinhard Diestel, Ken-ichi Kawarabayashi, Theodor Müller, Paul Wollan
2012 J jnl
The Erdős-Pósa property for clique minors in highly connected graphs.
J. Comb. Theory B
Reinhard Diestel, Ken-ichi Kawarabayashi, Paul Wollan
2011 J jnl
Decomposing infinite matroids into their 3-connected minors.
Electron. Notes Discret. Math.
Elad Aigner-Horev, Reinhard Diestel, Luke Postle
2011 J jnl
Infinite matroids in graphs.
Discret. Math.
Henning Bruhn, Reinhard Diestel
2011 J jnl
Locally finite graphs with ends: A topological approach, I. Basic theory.
Discret. Math.
Reinhard Diestel
2011 J jnl
Twins of rayless graphs.
J. Comb. Theory B
Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel
2010 J jnl
Every rayless graph has an unfriendly partition.
Comb.
Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel
2010 J jnl
Locally finite graphs with ends: A topological approach, II. Applications.
Discret. Math.
Reinhard Diestel
2010 J jnl
The homology of a locally finite graph with ends.
Comb.
Reinhard Diestel, Philipp Sprüssel
2009 J jnl
Every rayless graph has an unfriendly partition.
Electron. Notes Discret. Math.
Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel
2009 J jnl
MacLane's theorem for arbitrary surfaces.
J. Comb. Theory B
Henning Bruhn, Reinhard Diestel
2006 J jnl
A Cantor-Bernstein Theorem for Paths in Graphs.
Am. Math. Mon.
Reinhard Diestel, Carsten Thomassen
2006 J jnl
Duality in Infinite Graphs.
Comb. Probab. Comput.
Henning Bruhn, Reinhard Diestel
2006 J jnl
End spaces and spanning trees.
J. Comb. Theory B
Reinhard Diestel
2006 J jnl
Global Connectivity And Expansion: Long Cycles and Factors In
Comb.
Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell
2006 — book
Graphentheorie (3. Aufl.).
Reinhard Diestel
2005 J jnl
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs.
J. Graph Theory
Henning Bruhn, Reinhard Diestel, Maya Stein
2005 J jnl
Graph minor hierarchies.
Discret. Appl. Math.
Reinhard Diestel, Daniela Kühn
2005 J jnl
Menger's theorem for infinite graphs with ends.
J. Graph Theory
Henning Bruhn, Reinhard Diestel, Maya Stein
2005 J jnl
The Cycle Space of an Infinite Graph.
Comb. Probab. Comput.
Reinhard Diestel
2005 J jnl
The Erdös-Menger conjecture for source/sink sets with disjoint closures.
J. Comb. Theory B
Reinhard Diestel
2004 J jnl
Dense Minors In Graphs Of Large Girth.
Comb.
Reinhard Diestel, Christof Rempel
2004 J jnl
On Infinite Cycles I.
Comb.
Reinhard Diestel, Daniela Kühn
2004 J jnl
On Infinite Cycles II.
Comb.
Reinhard Diestel, Daniela Kühn
2004 J jnl
On Infinite Cycles in Graphs: Or How to Make Graph Homology Interesting.
Am. Math. Mon.
Reinhard Diestel
2004 J jnl
Topological paths, cycles and spanning trees in infinite graphs.
Eur. J. Comb.
Reinhard Diestel, Daniela Kühn
2003 J jnl
Graph-theoretical versus topological ends of graphs.
J. Comb. Theory B
Reinhard Diestel, Daniela Kühn
2003 J jnl
On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets.
Order
Reinhard Diestel, Oleg Pikhurko
2003 J jnl
The countable Erds-Menger conjecture with ends.
J. Comb. Theory B
Reinhard Diestel
2002 J jnl
Two Short Proofs Concerning Tree-Decompositions.
Comb. Probab. Comput.
Patrick Bellenbaum, Reinhard Diestel
2001 J jnl
Relating Subsets of a Poset, and a Partition Theorem for WQOs.
Order
Reinhard Diestel
2000 J jnl
An accessibility theorem for infinite graph minors.
J. Graph Theory
Reinhard Diestel
1999 J jnl
A universal planar graph under the minor relation.
J. Graph Theory
Reinhard Diestel, Daniela Kühn
1999 J jnl
Excluding a Countable Clique.
J. Comb. Theory B
Reinhard Diestel, Robin Thomas
1999 J jnl
Highly Connected Sets and the Excluded Grid Theorem.
J. Comb. Theory B
Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, Carsten Thomassen
1995 J jnl
Graph Minors 1: A Short Proof of the Path-width Theorem.
Comb. Probab. Comput.
Reinhard Diestel
1994 J jnl
Domination Games on Infinite Graphs.
Theor. Comput. Sci.
Reinhard Diestel, Imre Leader
1994 J jnl
Menger's Theorem for a Countable Source Set.
Comb. Probab. Comput.
Ron Aharoni, Reinhard Diestel
1994 J jnl
The Depth-First Search Tree Structure of
J. Comb. Theory B
Reinhard Diestel
1994 J jnl
The Growth of Infinite Graphs: Boundedness and Finite Spreading.
Comb. Probab. Comput.
Reinhard Diestel, Imre Leader
1992 J jnl
On spanning trees and
J. Comb. Theory B
Reinhard Diestel
1992 J jnl
The end structure of a graph: recent results and open problems.
Discret. Math.
Reinhard Diestel
1992 J jnl
The structure of
J. Comb. Theory B
Reinhard Diestel
1991 J jnl
Decomposing infinite graphs.
Discret. Math.
Reinhard Diestel
1991 — conf
Dominating functions and topological graph minors.
Graph Structure Theory
Reinhard Diestel
1991 J jnl
Preface.
Discret. Math.
Reinhard Diestel
1990 J jnl
Simplicial tree-decompositions of infinite graphs, I.
J. Comb. Theory B
Reinhard Diestel
1990 J jnl
Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions.
J. Comb. Theory B
Reinhard Diestel
1990 J jnl
Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions.
J. Comb. Theory B
Reinhard Diestel
1989 J jnl
Simplicial decompositions of graphs: a survey of applications.
Discret. Math.
Reinhard Diestel
1988 J jnl
Tree-decompositions, tree-representability and chordal graphs.
Discret. Math.
Reinhard Diestel
1987 J jnl
A separation property of planar triangulations.
J. Graph Theory
Reinhard Diestel
1987 J jnl
Simplicial decompositions of graphs - Some uniqueness results.
J. Comb. Theory B
Reinhard Diestel
1985 J jnl
On Universal Graphs With Forbidden Topological Subgraphs.
Eur. J. Comb.
Reinhard Diestel
1985 J jnl
On the problem of finding small subdivision and homomorphism bases for classes of countable graphs.
Discret. Math.
Reinhard Diestel
1985 J jnl
Some remarks on universal graphs.
Comb.
Reinhard Diestel, Rudolf Halin, Walter Vogler