☰

Reinhard Diestel - Publications

Affiliations: 
Universität Hamburg, Hamburg, Hamburg, Germany 
Tree Info Similar researchers PubMed Report error

76 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Diestel R, Erde J, Weißauer D. Structural submodularity and tangles in abstract separation systems Journal of Combinatorial Theory, Series A. 167: 155-180. DOI: 10.1016/J.Jcta.2019.05.001  0.357
2019 Diestel R, Kneip J. Profinite Separation Systems Order. 37: 179-205. DOI: 10.1007/S11083-019-09499-Y  0.501
2019 Diestel R, Oum S. Tangle-Tree Duality: In Graphs, Matroids and Beyond Combinatorica. 39: 879-910. DOI: 10.1007/S00493-019-3798-5  0.632
2019 Diestel R, Hundertmark F, Lemanczyk S. Profiles of Separations: in Graphs, Matroids, and Beyond Combinatorica. 39: 37-75. DOI: 10.1007/S00493-017-3595-Y  0.714
2018 Diestel R. Abstract Separation Systems Order. 35: 157-170. DOI: 10.1007/S11083-017-9424-5  0.436
2018 Diestel R, Müller M. Connected tree-width Combinatorica. 38: 381-398. DOI: 10.1007/S00493-016-3516-5  0.617
2017 Diestel R, Eberenz P, Erde J. Duality Theorems for Blocks and Tangles in Graphs Siam Journal On Discrete Mathematics. 31: 1514-1528. DOI: 10.1137/16M1077763  0.661
2017 Diestel R, Pott J. Dual trees must share their ends Journal of Combinatorial Theory, Series B. 123: 32-53. DOI: 10.1016/J.Jctb.2016.11.005  0.717
2017 Diestel R. Ends and Tangles Abhandlungen Aus Dem Mathematischen Seminar Der Universitat Hamburg. 87: 223-244. DOI: 10.1007/S12188-016-0163-0  0.689
2016 Diestel R. A Simple Existence Criterion for Normal Spanning Trees Electronic Journal of Combinatorics. 23: 2-33. DOI: 10.37236/6070  0.567
2016 Aigner-Horev E, Diestel R, Postle L. The structure of 2-separations of infinite matroids Journal of Combinatorial Theory, Series B. 116: 25-56. DOI: 10.1016/J.Jctb.2015.05.011  0.341
2016 Carmesin J, Diestel R, Hamann M, Hundertmark F. Canonical tree-decompositions of finite graphs I. Existence and algorithms Journal of Combinatorial Theory. Series B. 116: 1-24. DOI: 10.1016/J.Jctb.2014.04.001  0.63
2015 Diestel R. Forcing Finite Minors in Sparse Infinite Graphs by Large-Degree Assumptions Electronic Journal of Combinatorics. 22: 1-43. DOI: 10.37236/2891  0.647
2014 Diestel R, Pott J. Orthogonality and Minimality in the Homology of Locally Finite Graphs Electronic Journal of Combinatorics. 21: 3-36. DOI: 10.37236/3844  0.385
2014 Carmesin J, Diestel R, Hamann M, Hundertmark F. K-blocks: A connectivity invariant for graphs Siam Journal On Discrete Mathematics. 28: 1876-1891. DOI: 10.1137/130923646  0.517
2014 Carmesin J, Diestel R, Hamann M, Hundertmark F. Canonical tree-decompositions of finite graphs II. Essential parts Journal of Combinatorial Theory. Series B. DOI: 10.1016/J.Jctb.2014.12.009  0.558
2014 Carmesin J, Diestel R, Hundertmark F, Stein M. Connectivity and tree structure in finite graphs Combinatorica. 34: 11-46. DOI: 10.1007/S00493-014-2898-5  0.632
2013 Bruhn H, Diestel R, Kriesell M, Pendavingh R, Wollan P. Axioms for infinite matroids Advances in Mathematics. 239: 18-46. DOI: 10.1016/J.Aim.2013.01.011  0.302
2012 Diestel R, Kawarabayashi K, MüLler T, Wollan P. On the excluded minor structure theorem for graphs of large tree-width Journal of Combinatorial Theory, Series B. 102: 1189-1210. DOI: 10.1016/J.Jctb.2012.07.001  0.65
2012 Diestel R, Kawarabayashi K, Wollan P. The Erdős-Pósa property for clique minors in highly connected graphs Journal of Combinatorial Theory, Series B. 102: 454-469. DOI: 10.1016/J.Jctb.2011.08.001  0.38
2012 Diestel R, Sprüssel P. Locally finite graphs with ends Discrete Mathematics. 312: 21-29. DOI: 10.1016/J.Disc.2011.02.007  0.64
2011 Diestel R, Sprüssel P. On the homology of locally compact spaces with ends Topology and Its Applications. 158: 1626-1639. DOI: 10.1016/J.Topol.2011.05.031  0.533
2011 Bonato A, Bruhn H, Diestel R, Sprüssel P. Twins of rayless graphs Journal of Combinatorial Theory, Series B. 101: 60-65. DOI: 10.1016/J.Jctb.2010.10.004  0.693
2011 Aigner-Horev E, Diestel R, Postle L. Decomposing infinite matroids into their 3-connected minors Electronic Notes in Discrete Mathematics. 38: 11-16. DOI: 10.1016/J.Endm.2011.09.003  0.32
2011 Bruhn H, Diestel R. Infinite matroids in graphs Discrete Mathematics. 311: 1461-1471. DOI: 10.1016/J.Disc.2010.12.015  0.598
2011 Diestel R. Locally finite graphs with ends: A topological approach, I. Basic theory Discrete Mathematics. 311: 1423-1447. DOI: 10.1016/J.Disc.2010.05.023  0.603
2011 Diestel R, Sprüssel P. The fundamental group of a locally finite graph with ends Advances in Mathematics. 226: 2643-2675. DOI: 10.1016/J.Aim.2010.09.008  0.504
2010 Diestel R. Locally finite graphs with ends: A topological approach, II. Applications Discrete Mathematics. 310: 2750-2765. DOI: 10.1016/J.Disc.2010.05.027  0.65
2010 Bruhn H, Diestel R, Georgakopoulos A, Sprüssel P. Every rayless graph has an unfriendly partition Combinatorica. 30: 521-532. DOI: 10.1007/S00493-010-2590-3  0.704
2010 Diestel R, Sprüssel P. The homology of a locally finite graph with ends Combinatorica. 30: 681-714. DOI: 10.1007/S00493-010-2481-7  0.636
2009 Bruhn H, Diestel R. MacLane's theorem for arbitrary surfaces Journal of Combinatorial Theory, Series B. 99: 275-286. DOI: 10.1016/J.Jctb.2008.03.005  0.419
2006 Diestel R, Leader I, Scott A, Thomassé S. Partitions and orientations of the Rado graph Transactions of the American Mathematical Society. 359: 2395-2405. DOI: 10.1090/S0002-9947-06-04086-4  0.676
2006 Diestel R, Thomassen C. A Cantor-Bernstein theorem for paths in graphs American Mathematical Monthly. 113: 161-165. DOI: 10.1080/00029890.2006.11920290  0.374
2006 Bruhn H, Diestel R. Duality in Infinite Graphs Combinatorics, Probability & Computing. 15: 75-90. DOI: 10.1017/S0963548305007261  0.701
2006 Diestel R. End spaces and spanning trees Journal of Combinatorial Theory, Series B. 96: 846-854. DOI: 10.1016/J.Jctb.2006.02.010  0.499
2006 Brandt S, Broersma H, Diestel R, Kriesell M. Global Connectivity And Expansion: Long Cycles and Factors In f -Connected Graphs Combinatorica. 26: 17-36. DOI: 10.1007/S00493-006-0002-5  0.376
2005 Diestel R. The Cycle Space of an Infinite Graph Combinatorics, Probability & Computing. 14: 59-79. DOI: 10.1017/S0963548304006686  0.702
2005 Diestel R. The Erdös-Menger conjecture for source/sink sets with disjoint closures Journal of Combinatorial Theory, Series B. 93: 107-114. DOI: 10.1016/J.Jctb.2004.08.004  0.529
2005 Diestel R, Kühn D. Graph minor hierarchies Discrete Applied Mathematics. 145: 167-182. DOI: 10.1016/J.Dam.2004.01.010  0.674
2004 Diestel R. On Infinite Cycles in Graphs- or How to Make Graph Homology Interesting American Mathematical Monthly. 111: 559-571. DOI: 10.1080/00029890.2004.11920115  0.691
2004 Diestel R, Kühn D. Topological paths, cycles and spanning trees in infinite graphs European Journal of Combinatorics. 25: 835-862. DOI: 10.1016/J.Ejc.2003.01.002  0.693
2004 Diestel R, Rempel C. Dense Minors In Graphs Of Large Girth Combinatorica. 25: 111-116. DOI: 10.1007/S00493-005-0009-3  0.531
2004 Diestel R, Kühn D. On Infinite Cycles I Combinatorica. 24: 69-89. DOI: 10.1007/S00493-004-0005-Z  0.62
2003 Diestel R, Pikhurko O. On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets Order. 20: 53-66. DOI: 10.1023/A:1024449306316  0.368
2003 Diestel R, Kühn D. Graph-theoretical versus topological ends of graphs Journal of Combinatorial Theory, Series B. 87: 197-206. DOI: 10.1016/S0095-8956(02)00034-5  0.697
2003 Diestel R. The countable Erdös-Menger conjecture with ends Journal of Combinatorial Theory, Series B. 87: 145-161. DOI: 10.1016/S0095-8956(02)00032-1  0.521
2002 Bellenbaum P, Diestel R. Two Short Proofs Concerning Tree-Decompositions Combinatorics, Probability & Computing. 11: 541-547. DOI: 10.1017/S0963548302005369  0.648
2001 Diestel R, Leader I. Normal Spanning Trees, Aronszajn Trees and Excluded Minors Journal of the London Mathematical Society-Second Series. 63: 16-32. DOI: 10.1112/S0024610700001708  0.691
2001 Diestel R, Leader I. A Conjecture Concerning a Limit of Non-Cayley Graphs Journal of Algebraic Combinatorics. 14: 17-25. DOI: 10.1023/A:1011257718029  0.696
1999 Diestel R, Thomas R. Excluding a Countable Clique Journal of Combinatorial Theory, Series B. 76: 41-67. DOI: 10.1006/Jctb.1998.1886  0.7
1999 Diestel R, Jensen TR, Gorbunov KY, Thomassen C. Highly Connected Sets and the Excluded Grid Theorem Journal of Combinatorial Theory, Series B. 75: 61-73. DOI: 10.1006/Jctb.1998.1862  0.617
1996 Diestel R. The Classification of Finitely Spreading Graphs Proceedings of the London Mathematical Society. 534-554. DOI: 10.1112/Plms/S3-73.3.534  0.689
1995 Diestel R. Graph Minors I: A Short Proof of the Path-width Theorem Combinatorics, Probability & Computing. 4: 27-30. DOI: 10.1017/S0963548300001450  0.584
1994 Diestel R, Shelah S, Steprāns J. Dominating Functions and Graphs Journal of the London Mathematical Society-Second Series. 49: 16-24. DOI: 10.1112/Jlms/49.1.16  0.643
1994 Brochet J-, Diestel R. Normal tree orders for infinite graphs Transactions of the American Mathematical Society. 345: 871-895. DOI: 10.1090/S0002-9947-1994-1260198-4  0.686
1994 Aharoni R, Diestel R. Menger's Theorem for a Countable Source Set Combinatorics, Probability & Computing. 3: 145-156. DOI: 10.1017/S0963548300001073  0.674
1994 Diestel R, Leader I. The Growth of Infinite Graphs: Boundedness and Finite Spreading Combinatorics, Probability & Computing. 3: 51-55. DOI: 10.1017/S0963548300000961  0.684
1994 Diestel R, Leader I. Domination games on infinite graphs Theoretical Computer Science. 132: 337-345. DOI: 10.1016/0304-3975(94)00032-8  0.637
1994 Diestel R. The depth-first search tree structure of TK a 0 -free graphs Journal of Combinatorial Theory, Series B. 61: 260-262. DOI: 10.1006/Jctb.1994.1048  0.688
1993 Diestel R, Jung HA, Möller RG. On vertex transitive graphs of infinite degree Archiv Der Mathematik. 60: 591-600. DOI: 10.1007/Bf01236086  0.621
1992 Diestel R. The structure of TK a -free graphs Journal of Combinatorial Theory, Series B. 54: 222-238. DOI: 10.1016/0095-8956(92)90054-2  0.706
1992 Diestel R. On spanning trees and k -connectedness in infinite graphs Journal of Combinatorial Theory, Series B. 56: 263-277. DOI: 10.1016/0095-8956(92)90022-P  0.666
1992 Diestel R. The end structure of a graph: recent results and open problems Discrete Mathematics. 100: 313-327. DOI: 10.1016/0012-365X(92)90650-5  0.626
1992 Diestel R, Leader I. A proof of the bounded graph conjecture Inventiones Mathematicae. 108: 131-162. DOI: 10.1007/Bf02100602  0.688
1991 Diestel R. Decomposing infinite graphs Discrete Mathematics. 95: 69-89. DOI: 10.1016/0012-365X(91)90330-5  0.655
1990 Diestel R. Simplicial tree-decompositions of infinite graphs. I Journal of Combinatorial Theory, Series B. 48: 197-215. DOI: 10.1016/0095-8956(90)90118-J  0.681
1990 Diestel R. Simplicial tree-decomposition of infinite graphs. III. The uniqueness of prime decompositions Journal of Combinatorial Theory, Series B. 50: 117-128. DOI: 10.1016/0095-8956(90)90100-E  0.664
1990 Diestel R. Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions Journal of Combinatorial Theory, Series B. 50: 93-116. DOI: 10.1016/0095-8956(90)90099-L  0.668
1990 Diestel R. A compactness theorem for complete separators Abhandlungen Aus Dem Mathematischen Seminar Der Universitat Hamburg. 60: 149-151. DOI: 10.1007/Bf02941054  0.578
1989 Diestel R. Simplicial decompositions of graphs: a survey of applications Discrete Mathematics. 75: 121-144. DOI: 10.1016/0012-365X(89)90084-8  0.678
1988 Diestel R. Tree-decompositions, tree-representability and choral graphs Discrete Mathematics. 71: 181-184. DOI: 10.1016/0012-365X(88)90071-4  0.615
1987 Diestel R. Simplicial decompositions of graphs—some uniqueness results Journal of Combinatorial Theory, Series B. 42: 133-145. DOI: 10.1016/0095-8956(87)90035-9  0.614
1987 Diestel R. A separation property of planar triangulations Journal of Graph Theory. 11: 43-52. DOI: 10.1002/Jgt.3190110108  0.674
1985 Diestel R. On Universal Graphs With Forbidden Topological Subgraphs European Journal of Combinatorics. 6: 175-182. DOI: 10.1016/S0195-6698(85)80008-1  0.506
1985 Diestel R. On the problem of finding small subdivision and homomorphism bases for classes of countable graphs Discrete Mathematics. 55: 21-33. DOI: 10.1016/S0012-365X(85)80018-2  0.648
1985 Diestel R, Halin R, Vogler W. Some remarks on universal graphs Combinatorica. 5: 283-293. DOI: 10.1007/Bf02579242  0.626
Show low-probability matches.