×

zbMATH — the first resource for mathematics

Diestel, Reinhard

Compute Distance To:
Author ID: diestel.reinhard Recent zbMATH articles by "Diestel, Reinhard"
Published as: Diestel, Reinhard; Diestel, R.; Diestel, Reinhardt
Homepage: http://www.math.uni-hamburg.de/home/diestel/
External Links: MGP · Wikidata · GND
Documents Indexed: 115 Publications since 1985, including 16 Books

Publications by Year

Citations contained in zbMATH Open

92 Publications have been cited 2,126 times in 1,733 Documents Cited by Year
Graph theory. 3rd revised and updated ed. Zbl 1074.05001
Diestel, Reinhard
517
2005
Graph theory. 4th ed. Zbl 1204.05001
Diestel, Reinhard
407
2010
Graph theory. 2nd ed. Zbl 0945.05002
Diestel, Reinhard
288
2000
Graph theory. 5th edition. Zbl 1375.05002
Diestel, Reinhard
78
2017
Graph theory. 3rd edition, reprint of the 2005 hardback edition. Zbl 1086.05001
Diestel, Reinhard
75
2006
Graph theory. Transl. from the German. Zbl 0873.05001
Diestel, Reinhard
51
1997
Highly connected sets and the excluded grid theorem. Zbl 0949.05075
Diestel, Reinhard; Jensen, Tommy R.; Gorbunov, Konstantin Yu.; Thomassen, Carsten
45
1999
On infinite cycles. I, II. Zbl 1063.05076
Diestel, R.; Kühn, Daniela
38
2004
Graph decompositions. A study in infinite graph theory. Zbl 0726.05001
Diestel, Reinhard
37
1990
Graph theory. 2., neu bearb. und erw. Aufl. (Graphentheorie.) Zbl 0957.05001
Diestel, Reinhard
33
2000
Topological paths, cycles and spanning trees in infinite graphs. Zbl 1050.05071
Diestel, Reinhard; Kühn, Daniela
33
2004
Axioms for infinite matroids. Zbl 1279.05013
Bruhn, Henning; Diestel, Reinhard; Kriesell, Matthias; Pendavingh, Rudi; Wollan, Paul
30
2013
A conjecture concerning a limit of non-Cayley graphs. Zbl 0985.05020
Diestel, Reinhard; Leader, Imre
28
2001
The cycle space of an infinite graph. Zbl 1067.05037
Diestel, Reinhard
27
2005
Graph-theoretical versus topological ends of graphs. Zbl 1035.05031
Diestel, Reinhard; Kühn, Daniela
26
2003
Duality in infinite graphs. Zbl 1082.05028
Bruhn, Henning; Diestel, Reinhard
19
2006
Two short proofs concerning tree-decompositions. Zbl 1018.05081
Bellenbaum, Patrick; Diestel, Reinhard
17
2002
Infinite matroids in graphs. Zbl 1231.05055
Bruhn, Henning; Diestel, Reinhard
14
2011
Directions in infinite graph theory and combinatorics. Proceedings of a colloquium, held at St. John’s College, Cambridge, UK, July 1989. With an introduction by C. St. J. A. Nash-Williams. Reprinted from the journal Discrete Mathematics 95, Nos. 1-3 (1991). Zbl 0751.05002
Diestel, R. (ed.)
14
1992
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. Zbl 1077.05081
Bruhn, Henning; Diestel, Reinhard; Stein, Maya
11
2005
On vertex transitive graphs of infinite degree. Zbl 0791.05052
Diestel, R.; Jung, H. A.; Möller, R. G.
11
1993
Connectivity and tree structure in finite graphs. Zbl 1324.05104
Carmesin, Johannes; Diestel, Reinhard; Hundertmark, Fabian; Stein, Maya
10
2014
A proof of the bounded graph conjecture. Zbl 0793.05121
Diestel, Reinhard; Leader, Imre
10
1992
Profiles of separations: in graphs, matroids, and beyond. Zbl 1438.05040
Diestel, Reinhard; Hundertmark, Fabian; Lemanczyk, Sahar
10
2019
Normal spanning trees, Aronszajn trees and excluded minors. Zbl 1012.05051
Diestel, Reinhard; Leader, Imre
9
2001
Dense minors in graphs of large girth. Zbl 1065.05086
Diestel, Reinhard; Rempel, Christof
9
2005
Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs. Zbl 1112.05059
Brandt, Stephan; Broersma, Hajo; Diestel, Reinhard; Kriesell, Matthias
9
2006
End spaces and spanning trees. Zbl 1107.05028
Diestel, Reinhard
9
2006
Locally finite graphs with ends: A topological approach. II: Applications. Zbl 1223.05197
Diestel, Reinhard
9
2010
Canonical tree-decompositions of finite graphs. I: Existence and algorithms. Zbl 1327.05269
Carmesin, J.; Diestel, R.; Hamann, M.; Hundertmark, F.
9
2016
The end structure of a graph: Recent results and open problems. Zbl 0780.05012
Diestel, Reinhard
9
1992
Simplicial decompositions of graphs: A survey of applications. Zbl 0669.05053
Diestel, Reinhard
9
1989
\(k\)-blocks: a connectivity invariant for graphs. Zbl 1309.05170
Carmesin, J.; Diestel, R.; Hamann, M.; Hundertmark, F.
9
2014
Unifying duality theorems for width parameters in graphs and matroids (extended abstract). Zbl 1409.05045
Diestel, Reinhard; Oum, Sang-il
8
2014
The Erdős-Pósa property for clique minors in highly connected graphs. Zbl 1239.05172
Diestel, Reinhard; Kawarabayashi, Ken-Ichi; Wollan, Paul
8
2012
Duality theorems for blocks and tangles in graphs. Zbl 1366.05103
Diestel, Reinhard; Eberenz, Philipp; Erde, Joshua
8
2017
Graph theory. 4th enlarged and updated ed. (Graphentheorie.) Zbl 1218.05001
Diestel, Reinhard
7
2010
Locally finite graphs with ends: A topological approach. I: Basic theory. Zbl 1223.05198
Diestel, Reinhard
7
2011
On spanning trees and \(k\)-connectedness in infinite graphs. Zbl 0780.05013
Diestel, Reinhard
7
1992
Simplicial decompositions of graphs - some uniqueness results. Zbl 0582.05045
Diestel, Reinhard
7
1987
Canonical tree-decompositions of finite graphs. II. Essential parts. Zbl 1332.05134
Carmesin, J.; Diestel, R.; Hamann, M.; Hundertmark, F.
7
2016
The fundamental group of a locally finite graph with ends. Zbl 1298.05324
Diestel, Reinhard; Sprüssel, Philipp
6
2011
Graph minors. I: A short proof of the path-width theorem. Zbl 0829.05039
Diestel, Reinhard
6
1995
The homology of a locally finite graph with ends. Zbl 1240.05222
Diestel, Reinhard; Sprüssel, Philipp
6
2010
Simplicial tree-decompositions of infinite graphs. I. Zbl 0722.05050
Diestel, Reinhard
6
1990
Tree sets. Zbl 1412.06002
Diestel, Reinhard
6
2018
Menger’s theorem for infinite graphs with ends. Zbl 1077.05053
Bruhn, Henning; Diestel, Reinhard; Stein, Maya
5
2005
Simplicial minors and decompositions of graphs. Zbl 0691.05036
Diestel, Reinhard
5
1988
Simplicial tree-decompositions of infinite graphs. III: The uniqueness of prime decompositions. Zbl 0714.05048
Diestel, Reinhard
5
1990
Excluding a countable clique. Zbl 0935.05083
Diestel, Reinhard; Thomas, Robin
4
1999
Graph theory. (Graphentheorie.) Zbl 0859.05001
Diestel, Reinhard
4
1996
Normal tree orders for infinite graphs. Zbl 0814.05029
Brochet, J.-M.; Diestel, R.
4
1994
The countable Erdős-Menger conjecture with ends. Zbl 1021.05063
Diestel, Reinhard
4
2003
Directions in infinite graph theory and combinatorics. Proceedings of a colloquium, held at St. John‘s College, Cambridge, UK, in July 1989. With an introduction by C. St. J. A. Nash-Williams. Zbl 0743.00046
Diestel, R. (ed.)
4
1991
On the problem of finding small subdivision and homomorphism bases for classes of countable graphs. Zbl 0571.05042
Diestel, Reinhard
4
1985
Some remarks on universal graphs. Zbl 0619.05039
Diestel, Reinhard; Halin, Rudolf; Vogler, Walter
4
1985
On end-faithful spanning trees in infinite graphs. Zbl 0714.05020
Diestel, Reinhard
4
1990
Simplicial tree-decompositions of infinite graphs. II: The existence of prime decompositions. Zbl 0722.05051
Diestel, Reinhard
4
1990
Ends and tangles. Zbl 1377.05126
Diestel, Reinhard
4
2017
Tangle-tree duality: in graphs, matroids and beyond. Zbl 1449.05156
Diestel, Reinhard; Oum, Sang-Il
4
2019
A universal planar graph under the minor relation. Zbl 0932.05025
Diestel, Reinhard; Kühn, Daniela
3
1999
The classification of finitely spreading graphs. Zbl 0865.05062
Diestel, Reinhard
3
1996
Menger’s theorem for a countable source set. Zbl 0817.05037
Aharoni, Ron; Diestel, Reinhard
3
1994
The depth-first search tree structure of \(TK_{\aleph_ 0}\)-free graphs. Zbl 0809.05079
Diestel, Reinhard
3
1994
Graph minor hierarchies. Zbl 1055.05140
Diestel, Reinhard; Kühn, Daniela
3
2005
A short proof of Halin’s grid theorem. Zbl 1062.05138
Diestel, R.
3
2004
On infinite cycles in graphs – or how to make graph homology interesting. Zbl 1187.05031
Diestel, Reinhard
3
2004
Dominating functions and graphs. Zbl 0793.04003
Diestel, Reinhard; Shelah, Saharon; Steprāns, Juris
3
1994
Locally finite graphs with ends: a topological approach. III. Fundamental group and homology. Zbl 1233.05139
Diestel, Reinhard; Sprüssel, Philipp
3
2012
On the excluded minor structure theorem for graphs of large tree-width. Zbl 1256.05229
Diestel, Reinhard; Kawarabayashi, Ken-Ichi; Müller, Theodor; Wollan, Paul
3
2012
Decomposing infinite graphs. Zbl 0759.05069
Diestel, Reinhard
3
1991
Tree-decompositions, tree-representability and chordal graphs. Zbl 0648.05047
Diestel, Reinhard
3
1988
Simplicial decompositions, tree-decompositions and graph minors. Zbl 0661.05051
Diestel, Reinhard
3
1988
MacLane’s theorem for arbitrary surfaces. Zbl 1180.05036
Bruhn, Henning; Diestel, Reinhard
2
2009
Graph theory. 3rd revised and extended ed. (Graphentheorie.) Zbl 1093.05001
Diestel, Reinhard
2
2006
On the homology of locally compact spaces with ends. Zbl 1257.55004
Diestel, Reinhard; Sprüssel, Philipp
2
2011
Relating subsets of a poset, and a partition theorem for WQOs. Zbl 1004.06002
Diestel, Reinhard
2
2001
Twins of rayless graphs. Zbl 1221.05039
Bonato, Anthony; Bruhn, Henning; Diestel, Reinhard; Sprüssel, Philipp
2
2011
The structure of 2-separations of infinite matroids. Zbl 1327.05050
Aigner-Horev, Elad; Diestel, Reinhard; Postle, Luke
2
2016
Every rayless graph has an unfriendly partition. Zbl 1273.05153
Bruhn, Henning; Diestel, Reinhard; Georgakopoulos, Agelos; Sprüssel, Philipp
2
2009
On universal graphs with forbidden topological subgraphs. Zbl 0581.05020
Diestel, Reinhard
2
1985
A separation property of planar triangulations. Zbl 0612.05055
Diestel, Reinhard
2
1987
Structural submodularity and tangles in abstract separation systems. Zbl 1417.05162
Diestel, Reinhard; Erde, Joshua; Weißauer, Daniel
2
2019
The Erdős-Menger conjecture for source/sink sets with disjoint closures. Zbl 1059.05063
Diestel, Reinhard
1
2005
Partitions and orientations of the Rado graph. Zbl 1107.05042
Diestel, Reinhard; Leader, Imre; Scott, Alex; Thomassé, Stéphan
1
2007
A compactness theorem for complete separators. Zbl 0749.05045
Diestel, R.
1
1990
Graph theory. Abstracts from the workshop held February 21st – February 27th, 2010. Zbl 1209.00049
Diestel, Reinhard (ed.); Schrijver, Alexander (ed.); Seymour, Paul (ed.)
1
2010
Every rayless graph has an unfriendly partition. Zbl 1231.05211
Bruhn, Henning; Diestel, Reinhard; Georgakopoulos, Agelos; Sprüssel, Philipp
1
2010
Simplicial tree-decompositions of graphs. Zbl 1109.05326
Diestel, Reinhard
1
1987
The structure of \(TK_ a\)-free graphs. Zbl 0764.05078
Diestel, Reinhard
1
1992
Dual trees must share their ends. Zbl 1354.05096
Diestel, Reinhard; Pott, Julian
1
2017
Connected tree-width. Zbl 1399.05207
Diestel, Reinhard; Müller, Malte
1
2018
Profiles of separations: in graphs, matroids, and beyond. Zbl 1438.05040
Diestel, Reinhard; Hundertmark, Fabian; Lemanczyk, Sahar
10
2019
Tangle-tree duality: in graphs, matroids and beyond. Zbl 1449.05156
Diestel, Reinhard; Oum, Sang-Il
4
2019
Structural submodularity and tangles in abstract separation systems. Zbl 1417.05162
Diestel, Reinhard; Erde, Joshua; Weißauer, Daniel
2
2019
Tree sets. Zbl 1412.06002
Diestel, Reinhard
6
2018
Connected tree-width. Zbl 1399.05207
Diestel, Reinhard; Müller, Malte
1
2018
Graph theory. 5th edition. Zbl 1375.05002
Diestel, Reinhard
78
2017
Duality theorems for blocks and tangles in graphs. Zbl 1366.05103
Diestel, Reinhard; Eberenz, Philipp; Erde, Joshua
8
2017
Ends and tangles. Zbl 1377.05126
Diestel, Reinhard
4
2017
Dual trees must share their ends. Zbl 1354.05096
Diestel, Reinhard; Pott, Julian
1
2017
Canonical tree-decompositions of finite graphs. I: Existence and algorithms. Zbl 1327.05269
Carmesin, J.; Diestel, R.; Hamann, M.; Hundertmark, F.
9
2016
Canonical tree-decompositions of finite graphs. II. Essential parts. Zbl 1332.05134
Carmesin, J.; Diestel, R.; Hamann, M.; Hundertmark, F.
7
2016
The structure of 2-separations of infinite matroids. Zbl 1327.05050
Aigner-Horev, Elad; Diestel, Reinhard; Postle, Luke
2
2016
Connectivity and tree structure in finite graphs. Zbl 1324.05104
Carmesin, Johannes; Diestel, Reinhard; Hundertmark, Fabian; Stein, Maya
10
2014
\(k\)-blocks: a connectivity invariant for graphs. Zbl 1309.05170
Carmesin, J.; Diestel, R.; Hamann, M.; Hundertmark, F.
9
2014
Unifying duality theorems for width parameters in graphs and matroids (extended abstract). Zbl 1409.05045
Diestel, Reinhard; Oum, Sang-il
8
2014
Axioms for infinite matroids. Zbl 1279.05013
Bruhn, Henning; Diestel, Reinhard; Kriesell, Matthias; Pendavingh, Rudi; Wollan, Paul
30
2013
The Erdős-Pósa property for clique minors in highly connected graphs. Zbl 1239.05172
Diestel, Reinhard; Kawarabayashi, Ken-Ichi; Wollan, Paul
8
2012
Locally finite graphs with ends: a topological approach. III. Fundamental group and homology. Zbl 1233.05139
Diestel, Reinhard; Sprüssel, Philipp
3
2012
On the excluded minor structure theorem for graphs of large tree-width. Zbl 1256.05229
Diestel, Reinhard; Kawarabayashi, Ken-Ichi; Müller, Theodor; Wollan, Paul
3
2012
Infinite matroids in graphs. Zbl 1231.05055
Bruhn, Henning; Diestel, Reinhard
14
2011
Locally finite graphs with ends: A topological approach. I: Basic theory. Zbl 1223.05198
Diestel, Reinhard
7
2011
The fundamental group of a locally finite graph with ends. Zbl 1298.05324
Diestel, Reinhard; Sprüssel, Philipp
6
2011
On the homology of locally compact spaces with ends. Zbl 1257.55004
Diestel, Reinhard; Sprüssel, Philipp
2
2011
Twins of rayless graphs. Zbl 1221.05039
Bonato, Anthony; Bruhn, Henning; Diestel, Reinhard; Sprüssel, Philipp
2
2011
Graph theory. 4th ed. Zbl 1204.05001
Diestel, Reinhard
407
2010
Locally finite graphs with ends: A topological approach. II: Applications. Zbl 1223.05197
Diestel, Reinhard
9
2010
Graph theory. 4th enlarged and updated ed. (Graphentheorie.) Zbl 1218.05001
Diestel, Reinhard
7
2010
The homology of a locally finite graph with ends. Zbl 1240.05222
Diestel, Reinhard; Sprüssel, Philipp
6
2010
Graph theory. Abstracts from the workshop held February 21st – February 27th, 2010. Zbl 1209.00049
Diestel, Reinhard; Schrijver, Alexander; Seymour, Paul
1
2010
Every rayless graph has an unfriendly partition. Zbl 1231.05211
Bruhn, Henning; Diestel, Reinhard; Georgakopoulos, Agelos; Sprüssel, Philipp
1
2010
MacLane’s theorem for arbitrary surfaces. Zbl 1180.05036
Bruhn, Henning; Diestel, Reinhard
2
2009
Every rayless graph has an unfriendly partition. Zbl 1273.05153
Bruhn, Henning; Diestel, Reinhard; Georgakopoulos, Agelos; Sprüssel, Philipp
2
2009
Partitions and orientations of the Rado graph. Zbl 1107.05042
Diestel, Reinhard; Leader, Imre; Scott, Alex; Thomassé, Stéphan
1
2007
Graph theory. 3rd edition, reprint of the 2005 hardback edition. Zbl 1086.05001
Diestel, Reinhard
75
2006
Duality in infinite graphs. Zbl 1082.05028
Bruhn, Henning; Diestel, Reinhard
19
2006
Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs. Zbl 1112.05059
Brandt, Stephan; Broersma, Hajo; Diestel, Reinhard; Kriesell, Matthias
9
2006
End spaces and spanning trees. Zbl 1107.05028
Diestel, Reinhard
9
2006
Graph theory. 3rd revised and extended ed. (Graphentheorie.) Zbl 1093.05001
Diestel, Reinhard
2
2006
Graph theory. 3rd revised and updated ed. Zbl 1074.05001
Diestel, Reinhard
517
2005
The cycle space of an infinite graph. Zbl 1067.05037
Diestel, Reinhard
27
2005
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. Zbl 1077.05081
Bruhn, Henning; Diestel, Reinhard; Stein, Maya
11
2005
Dense minors in graphs of large girth. Zbl 1065.05086
Diestel, Reinhard; Rempel, Christof
9
2005
Menger’s theorem for infinite graphs with ends. Zbl 1077.05053
Bruhn, Henning; Diestel, Reinhard; Stein, Maya
5
2005
Graph minor hierarchies. Zbl 1055.05140
Diestel, Reinhard; Kühn, Daniela
3
2005
The Erdős-Menger conjecture for source/sink sets with disjoint closures. Zbl 1059.05063
Diestel, Reinhard
1
2005
On infinite cycles. I, II. Zbl 1063.05076
Diestel, R.; Kühn, Daniela
38
2004
Topological paths, cycles and spanning trees in infinite graphs. Zbl 1050.05071
Diestel, Reinhard; Kühn, Daniela
33
2004
A short proof of Halin’s grid theorem. Zbl 1062.05138
Diestel, R.
3
2004
On infinite cycles in graphs – or how to make graph homology interesting. Zbl 1187.05031
Diestel, Reinhard
3
2004
Graph-theoretical versus topological ends of graphs. Zbl 1035.05031
Diestel, Reinhard; Kühn, Daniela
26
2003
The countable Erdős-Menger conjecture with ends. Zbl 1021.05063
Diestel, Reinhard
4
2003
Two short proofs concerning tree-decompositions. Zbl 1018.05081
Bellenbaum, Patrick; Diestel, Reinhard
17
2002
A conjecture concerning a limit of non-Cayley graphs. Zbl 0985.05020
Diestel, Reinhard; Leader, Imre
28
2001
Normal spanning trees, Aronszajn trees and excluded minors. Zbl 1012.05051
Diestel, Reinhard; Leader, Imre
9
2001
Relating subsets of a poset, and a partition theorem for WQOs. Zbl 1004.06002
Diestel, Reinhard
2
2001
Graph theory. 2nd ed. Zbl 0945.05002
Diestel, Reinhard
288
2000
Graph theory. 2., neu bearb. und erw. Aufl. (Graphentheorie.) Zbl 0957.05001
Diestel, Reinhard
33
2000
Highly connected sets and the excluded grid theorem. Zbl 0949.05075
Diestel, Reinhard; Jensen, Tommy R.; Gorbunov, Konstantin Yu.; Thomassen, Carsten
45
1999
Excluding a countable clique. Zbl 0935.05083
Diestel, Reinhard; Thomas, Robin
4
1999
A universal planar graph under the minor relation. Zbl 0932.05025
Diestel, Reinhard; Kühn, Daniela
3
1999
Graph theory. Transl. from the German. Zbl 0873.05001
Diestel, Reinhard
51
1997
Graph theory. (Graphentheorie.) Zbl 0859.05001
Diestel, Reinhard
4
1996
The classification of finitely spreading graphs. Zbl 0865.05062
Diestel, Reinhard
3
1996
Graph minors. I: A short proof of the path-width theorem. Zbl 0829.05039
Diestel, Reinhard
6
1995
Normal tree orders for infinite graphs. Zbl 0814.05029
Brochet, J.-M.; Diestel, R.
4
1994
Menger’s theorem for a countable source set. Zbl 0817.05037
Aharoni, Ron; Diestel, Reinhard
3
1994
The depth-first search tree structure of \(TK_{\aleph_ 0}\)-free graphs. Zbl 0809.05079
Diestel, Reinhard
3
1994
Dominating functions and graphs. Zbl 0793.04003
Diestel, Reinhard; Shelah, Saharon; Steprāns, Juris
3
1994
On vertex transitive graphs of infinite degree. Zbl 0791.05052
Diestel, R.; Jung, H. A.; Möller, R. G.
11
1993
Directions in infinite graph theory and combinatorics. Proceedings of a colloquium, held at St. John’s College, Cambridge, UK, July 1989. With an introduction by C. St. J. A. Nash-Williams. Reprinted from the journal Discrete Mathematics 95, Nos. 1-3 (1991). Zbl 0751.05002
Diestel, R.
14
1992
A proof of the bounded graph conjecture. Zbl 0793.05121
Diestel, Reinhard; Leader, Imre
10
1992
The end structure of a graph: Recent results and open problems. Zbl 0780.05012
Diestel, Reinhard
9
1992
On spanning trees and \(k\)-connectedness in infinite graphs. Zbl 0780.05013
Diestel, Reinhard
7
1992
The structure of \(TK_ a\)-free graphs. Zbl 0764.05078
Diestel, Reinhard
1
1992
Directions in infinite graph theory and combinatorics. Proceedings of a colloquium, held at St. John‘s College, Cambridge, UK, in July 1989. With an introduction by C. St. J. A. Nash-Williams. Zbl 0743.00046
Diestel, R.
4
1991
Decomposing infinite graphs. Zbl 0759.05069
Diestel, Reinhard
3
1991
Graph decompositions. A study in infinite graph theory. Zbl 0726.05001
Diestel, Reinhard
37
1990
Simplicial tree-decompositions of infinite graphs. I. Zbl 0722.05050
Diestel, Reinhard
6
1990
Simplicial tree-decompositions of infinite graphs. III: The uniqueness of prime decompositions. Zbl 0714.05048
Diestel, Reinhard
5
1990
On end-faithful spanning trees in infinite graphs. Zbl 0714.05020
Diestel, Reinhard
4
1990
Simplicial tree-decompositions of infinite graphs. II: The existence of prime decompositions. Zbl 0722.05051
Diestel, Reinhard
4
1990
A compactness theorem for complete separators. Zbl 0749.05045
Diestel, R.
1
1990
Simplicial decompositions of graphs: A survey of applications. Zbl 0669.05053
Diestel, Reinhard
9
1989
Simplicial minors and decompositions of graphs. Zbl 0691.05036
Diestel, Reinhard
5
1988
Tree-decompositions, tree-representability and chordal graphs. Zbl 0648.05047
Diestel, Reinhard
3
1988
Simplicial decompositions, tree-decompositions and graph minors. Zbl 0661.05051
Diestel, Reinhard
3
1988
Simplicial decompositions of graphs - some uniqueness results. Zbl 0582.05045
Diestel, Reinhard
7
1987
A separation property of planar triangulations. Zbl 0612.05055
Diestel, Reinhard
2
1987
Simplicial tree-decompositions of graphs. Zbl 1109.05326
Diestel, Reinhard
1
1987
On the problem of finding small subdivision and homomorphism bases for classes of countable graphs. Zbl 0571.05042
Diestel, Reinhard
4
1985
Some remarks on universal graphs. Zbl 0619.05039
Diestel, Reinhard; Halin, Rudolf; Vogler, Walter
4
1985
On universal graphs with forbidden topological subgraphs. Zbl 0581.05020
Diestel, Reinhard
2
1985
all top 5

Cited by 2,449 Authors

56 Diestel, Reinhard
36 Thilikos, Dimitrios M.
32 Paulusma, Daniël
27 Kawarabayashi, Ken-ichi
25 Bruhn, Henning
24 Sau, Ignasi
24 Saurabh, Saket
19 Georgakopoulos, Agelos
19 Golovach, Petr A.
16 Carmesin, Johannes
16 Kamiński, Marcin Marek
14 Furuya, Michitaka
14 van der Holst, Hein
13 Ganian, Robert
12 Bowler, Nathan
12 Kaiser, Tomáš
12 Kanté, Mamadou Moustapha
12 Thomas, Robin
11 Chandran, L. Sunil
11 Courcelle, Bruno
11 Fomin, Fedor V.
11 Joret, Gwenaël
11 Kreutzer, Stephan
11 Kwon, Ojoung
11 Milanič, Martin
11 Mohar, Bojan
11 Stein, Maya Jakobine
11 van ’t Hof, Pim
11 Wollan, Paul
11 Wood, David Ronald
10 Chiba, Shuya
10 Kratsch, Dieter
10 Kriesell, Matthias
10 Mota, Guilherme Oliveira
10 Ordyniak, Sebastian
10 Oum, Sang-Il
10 Raman, Venkatesh
10 Škoviera, Martin
10 Sprussel, Philipp
10 Sudakov, Benny
9 Kobayashi, Yusuke
9 Kühn, Daniela
9 Lokshtanov, Daniel
9 Pilipczuk, Marcin
9 Raymond, Jean-Florent
9 Richter, Robert Bruce
9 Yang, Xiaofan
9 Zhang, Cunquan
8 Bodlaender, Hans L.
8 Botler, Fábio
8 Dong, Qiang
8 Krivelevich, Michael
8 Möller, Rögnvaldur G.
8 Philip, Geevarghese
8 Thomassen, Carsten
8 Zhang, Heping
7 Adler, Isolde
7 Baste, Julien
7 Chiaselotti, Giampiero
7 Erde, Joshua
7 Fiorini, Samuel
7 Halin, Rudolf
7 Heggernes, Pinar
7 Hudry, Olivier
7 Král’, Daniel
7 Lehner, Florian
7 Panolan, Fahad
7 Paul, Christophe
7 Szeider, Stefan
7 Tale, Prafullkumar
7 Wakabayashi, Yoshiko
6 Arav, Marina
6 Bonamy, Marthe
6 Bonsma, Paul S.
6 Dragan, Feodor F.
6 Gentile, Tommaso
6 Grohe, Martin
6 Hamann, Matthias
6 Infusino, Federico G.
6 Jansen, Bart M. P.
6 Kratsch, Stefan
6 Lauri, Juho
6 Lobstein, Antoine-Christophe
6 Máčajová, Edita
6 Madaras, Tomáš
6 Oshiro, Marcio T. I.
6 Pilipczuk, Michał
6 Postle, Luke
6 Ramon, Jan
6 Ries, Bernard
6 Rossmanith, Peter
6 Seymour, Paul D.
6 Sorge, Manuel
6 Van Leeuwen, Erik Jan
6 Vialette, Stéphane
5 Belmonte, Rémy
5 Berger, Eli
5 Bonato, Anthony
5 Bousquet, Nicolas
5 Dalfó, Cristina
...and 2,349 more Authors
all top 5

Cited in 275 Serials

158 Discrete Mathematics
141 Journal of Combinatorial Theory. Series B
134 Discrete Applied Mathematics
88 Theoretical Computer Science
78 European Journal of Combinatorics
67 Graphs and Combinatorics
65 Algorithmica
36 Linear Algebra and its Applications
30 Information Processing Letters
29 Journal of Computer and System Sciences
26 Combinatorica
26 Journal of Combinatorial Optimization
23 Journal of Graph Theory
20 SIAM Journal on Discrete Mathematics
18 Discrete & Computational Geometry
17 Transactions of the American Mathematical Society
14 Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg
14 Theory of Computing Systems
13 The Electronic Journal of Combinatorics
12 Advances in Mathematics
12 Journal of Combinatorial Theory. Series A
12 Topology and its Applications
12 Order
10 Proceedings of the American Mathematical Society
10 Information and Computation
10 Combinatorics, Probability and Computing
9 Journal of Algebra
8 Automatica
8 Information Sciences
8 Journal of Algebraic Combinatorics
8 Discussiones Mathematicae. Graph Theory
8 Discrete Optimization
7 Annals of Pure and Applied Logic
7 Random Structures & Algorithms
7 Quantum Information Processing
6 Applied Mathematics and Computation
6 Advances in Applied Mathematics
6 Computational Geometry
6 Mathematical Problems in Engineering
6 Journal of Discrete Algorithms
5 Artificial Intelligence
5 Semigroup Forum
5 Games and Economic Behavior
5 European Journal of Operational Research
5 Archive for Mathematical Logic
5 Mathematical Programming. Series A. Series B
4 Journal of Statistical Physics
4 Mathematical Proceedings of the Cambridge Philosophical Society
4 Bulletin of Mathematical Biology
4 Geometriae Dedicata
4 Journal of Pure and Applied Algebra
4 Michigan Mathematical Journal
4 Systems & Control Letters
4 The Annals of Applied Probability
4 Distributed Computing
4 The Australasian Journal of Combinatorics
4 Annals of Combinatorics
4 Data Mining and Knowledge Discovery
4 Annals of Mathematics. Second Series
4 Acta Mathematica Sinica. English Series
4 Ars Mathematica Contemporanea
4 Journal of Theoretical Biology
4 Computer Science Review
3 Acta Informatica
3 International Journal of Theoretical Physics
3 Journal of Mathematical Biology
3 Linear and Multilinear Algebra
3 Annales de l’Institut Fourier
3 The Annals of Probability
3 Canadian Journal of Mathematics
3 Inventiones Mathematicae
3 Mathematische Annalen
3 SIAM Journal on Computing
3 Mathematical Social Sciences
3 Operations Research Letters
3 Acta Applicandae Mathematicae
3 International Journal of Approximate Reasoning
3 Annals of Operations Research
3 Stochastic Processes and their Applications
3 Journal of Logic, Language and Information
3 Journal of Mathematical Chemistry
3 Geometry & Topology
3 Algebraic & Geometric Topology
3 Journal of Algebra and its Applications
3 Proceedings of the Steklov Institute of Mathematics
3 Optimization Letters
3 Groups, Geometry, and Dynamics
3 Discrete Mathematics, Algorithms and Applications
3 Science China. Mathematics
3 Journal of Logical and Algebraic Methods in Programming
2 Computers & Mathematics with Applications
2 Communications in Mathematical Physics
2 Computer Methods in Applied Mechanics and Engineering
2 Israel Journal of Mathematics
2 Nuclear Physics. B
2 Rocky Mountain Journal of Mathematics
2 Annali di Matematica Pura ed Applicata. Serie Quarta
2 Archiv der Mathematik
2 Collectanea Mathematica
2 Czechoslovak Mathematical Journal
...and 175 more Serials
all top 5

Cited in 53 Fields

1,344 Combinatorics (05-XX)
441 Computer science (68-XX)
112 Operations research, mathematical programming (90-XX)
66 Mathematical logic and foundations (03-XX)
64 Convex and discrete geometry (52-XX)
62 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
42 Linear and multilinear algebra; matrix theory (15-XX)
42 Group theory and generalizations (20-XX)
40 Probability theory and stochastic processes (60-XX)
40 Biology and other natural sciences (92-XX)
37 Manifolds and cell complexes (57-XX)
36 Order, lattices, ordered algebraic structures (06-XX)
28 Commutative algebra (13-XX)
28 Statistical mechanics, structure of matter (82-XX)
27 Quantum theory (81-XX)
26 Numerical analysis (65-XX)
22 Information and communication theory, circuits (94-XX)
21 Systems theory; control (93-XX)
19 Statistics (62-XX)
18 General topology (54-XX)
17 Number theory (11-XX)
17 Dynamical systems and ergodic theory (37-XX)
11 Algebraic geometry (14-XX)
11 Associative rings and algebras (16-XX)
11 Functions of a complex variable (30-XX)
11 Ordinary differential equations (34-XX)
11 Partial differential equations (35-XX)
11 Operator theory (47-XX)
10 Measure and integration (28-XX)
10 Differential geometry (53-XX)
9 Functional analysis (46-XX)
9 Geometry (51-XX)
8 Nonassociative rings and algebras (17-XX)
8 Algebraic topology (55-XX)
6 Category theory; homological algebra (18-XX)
6 Potential theory (31-XX)
6 Calculus of variations and optimal control; optimization (49-XX)
6 Mechanics of deformable solids (74-XX)
5 General algebraic systems (08-XX)
5 Topological groups, Lie groups (22-XX)
4 Global analysis, analysis on manifolds (58-XX)
3 Difference and functional equations (39-XX)
3 Fluid mechanics (76-XX)
2 Field theory and polynomials (12-XX)
2 Real functions (26-XX)
2 Harmonic analysis on Euclidean spaces (42-XX)
1 General and overarching topics; collections (00-XX)
1 History and biography (01-XX)
1 \(K\)-theory (19-XX)
1 Special functions (33-XX)
1 Abstract harmonic analysis (43-XX)
1 Mechanics of particles and systems (70-XX)
1 Relativity and gravitational theory (83-XX)

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.