54 citations · 280 across the 32 of their papers we have counts for
6 papers · 1 filter
Locally finite graphs with ends: a topological approach
Reinhard Diestel
This paper is intended as an introductory survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Top…
Twins of rayless graphs
A. Bonato, H. Bruhn, R. Diestel +1
Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.
On the homology of locally finite graphs
Reinhard Diestel, Philipp Sprüssel
We show that the topological cycle space of a locally finite graph is a canonical quotient of the first singular homology group of its Freudenthal compactification, and we characte…
On the homology of locally compact spaces with ends
Reinhard Diestel, Philipp Sprüssel
We propose a homology theory for locally compact spaces with ends in which the ends play a special role. The approach is motivated by results for graphs with ends, where it has bee…
On the excluded minor structure theorem for graphs of large treewidth
R. Diestel, K. Kawarabayashi, T. Müller +1
At the core of the Robertson-Seymour theory of graph minors lies a powerful structure theorem which captures, for any fixed graph H, the common structural features of all the graph…
Every rayless graph has an unfriendly partition
Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos +1
We prove that every rayless graph has an unfriendly partition.