Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Diestel, Reinhard"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Unifying duality theorems for width parameters in graphs and matroids
Reinhard Diestel
,
Sang-il Oum
Lecture Notes in Computer Science
8747
, 2014, pp. 1-14
On the excluded minor structure theorem for graphs of large tree-width
Reinhard Diestel
,
Ken-ichi Kawarabayashi
,
Theodor Müller
,
Paul Wollan
Journal of Combinatorial Theory Series B
102
(6), 2012, pp. 1189-1210
The Erdŏs-Pósa property for clique minors in highly connected graphs
Reinhard Diestel
,
Ken-ichi Kawarabayashi
,
Paul Wollan
Journal of Combinatorial Theory Series B
102
(2), 2012, pp. 454-469
Twins of rayless graphs
Anthony Bonato
,
Henning Bruhn
,
Reinhard Diestel
,
Philipp Sprüssel
Journal of Combinatorial Theory Series B
101
(1), 2011, pp. 60-65
Every rayless graph has an unfriendly partition
Henning Bruhn
,
Reinhard Diestel
,
Agelos Georgakopoulos
,
Philipp Sprüssel
Combinatorica
30
(5), 2010, pp. 521-532
The homology of a locally finite graph with ends
Reinhard Diestel
,
Philipp Sprüssel
Combinatorica
30
(6), 2010, pp. 681-714
MacLane's theorem for arbitrary surfaces
Henning Bruhn
,
Reinhard Diestel
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 275-286
Global connectivity and expansion: Long cycles and factors in
f
-connected graphs
Stephan Brandt
,
Hajo Broersma
,
Reinhard Diestel
,
Matthias Kriesell
Combinatorica
26
(1), 2006, pp. 17-36
End spaces and spanning trees
Reinhard Diestel
Journal of Combinatorial Theory Series B
96
(6), 2006, pp. 846-854
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs
Henning Bruhn
,
Reinhard Diestel
,
Maya Stein
Journal of Graph Theory
50
(2), 2005, pp. 150-161
Menger's theorem for infinite graphs with ends
Henning Bruhn
,
Reinhard Diestel
,
Maya Stein
Journal of Graph Theory
50
(3), 2005, pp. 199-211
Dense minors in graphs of large girth
Reinhard Diestel
,
Christof Rempel
Combinatorica
25
(1), 2005, pp. 111-116
The Erdŏs-Menger conjecture for source/sink sets with disjoint closures
Reinhard Diestel
Journal of Combinatorial Theory Series B
93
(1), 2005, pp. 107-114
On infinite cycles I
Reinhard Diestel
,
Daniela Kühn
Combinatorica
24
(1), 2004, pp. 69-89
On infinite cycles II
Reinhard Diestel
,
Daniela Kühn
Combinatorica
24
(1), 2004, pp. 91-116
Connectivity and tree structure in finite graphs
Johannes Carmesin
,
Reinhard Diestel
,
Fabian Hundertmark
,
Maya Stein
Combinatorica
34
(1), 2003, pp. 11-46
Graph-theoretical versus topological ends of graphs
Reinhard Diestel
,
Daniela Kühn
Journal of Combinatorial Theory Series B
87
(1), 2003, pp. 197-206
The countable Erd\Hos-Menger conjecture with ends
Reinhard Diestel
Journal of Combinatorial Theory Series B
87
(1), 2003, pp. 145-161
An accessibility theorem for infinite graph minors
Reinhard Diestel
Journal of Graph Theory
35
(4), 2000, pp. 273-277
Highly connected sets and the excluded grid theorem
Reinhard Diestel
,
Tommy R. Jensen
,
Konstantin Yu. Gorbunov
,
Carsten Thomassen
Journal of Combinatorial Theory Series B
75
(1), 1999, pp. 61-73
A universal planar graph under the minor relation
Reinhard Diestel
,
Daniela Kühn
Journal of Graph Theory
32
(2), 1999, pp. 191-206
Excluding a countable clique
Reinhard Diestel
,
Robin Thomas
Journal of Combinatorial Theory Series B
76
(1), 1999, pp. 41-67
Matching
Reinhard Diestel
Graduate Texts in Mathematics
173
, 1997
The depth-first search tree structure of
TK_{\aleph _0}
-free graphs
Reinhard Diestel
Journal of Combinatorial Theory Series B
61
(2), 1994, pp. 260-262
The structure of
TK_a
-free graphs
Reinhard Diestel
Journal of Combinatorial Theory Series B
54
(2), 1992, pp. 222-238
Seiten 1
2
>