Diestel, Reinhard; Oum, Sang-il Tangle-tree duality in abstract separation systems. (English) Zbl 1471.05087 Adv. Math. 377, Article ID 107470, 25 p. (2021). MSC: 05C70 05C42 05C40 05C83 05C05 PDFBibTeX XMLCite \textit{R. Diestel} and \textit{S.-i. Oum}, Adv. Math. 377, Article ID 107470, 25 p. (2021; Zbl 1471.05087) Full Text: DOI arXiv
Diestel, Reinhard Tree sets. (English) Zbl 1412.06002 Order 35, No. 1, 171-192 (2018). Reviewer: Ioan Tomescu (Bucureşti) MSC: 06A07 05B35 05C05 PDFBibTeX XMLCite \textit{R. Diestel}, Order 35, No. 1, 171--192 (2018; Zbl 1412.06002) Full Text: DOI arXiv
Diestel, Reinhard Abstract separation systems. (English) Zbl 1469.06006 Order 35, No. 1, 157-170 (2018). MSC: 06A07 05C90 05E45 PDFBibTeX XMLCite \textit{R. Diestel}, Order 35, No. 1, 157--170 (2018; Zbl 1469.06006) Full Text: DOI arXiv
Diestel, Reinhard Ends and tangles. (English) Zbl 1377.05126 Abh. Math. Semin. Univ. Hamb. 87, No. 2, 223-244 (2017). MSC: 05C63 PDFBibTeX XMLCite \textit{R. Diestel}, Abh. Math. Semin. Univ. Hamb. 87, No. 2, 223--244 (2017; Zbl 1377.05126) Full Text: DOI arXiv
Diestel, Reinhard; Eberenz, Philipp; Erde, Joshua Duality theorems for blocks and tangles in graphs. (English) Zbl 1366.05103 SIAM J. Discrete Math. 31, No. 3, 1514-1528 (2017). MSC: 05C83 PDFBibTeX XMLCite \textit{R. Diestel} et al., SIAM J. Discrete Math. 31, No. 3, 1514--1528 (2017; Zbl 1366.05103) Full Text: DOI arXiv
Diestel, Reinhard A simple existence criterion for normal spanning trees. (English) Zbl 1336.05030 Electron. J. Comb. 23, No. 2, Research Paper P2.33, 7 p. (2016). MSC: 05C05 05C63 05C75 05C83 PDFBibTeX XMLCite \textit{R. Diestel}, Electron. J. Comb. 23, No. 2, Research Paper P2.33, 7 p. (2016; Zbl 1336.05030) Full Text: Link
Carmesin, J.; Diestel, R.; Hamann, M.; Hundertmark, F. Canonical tree-decompositions of finite graphs. II. Essential parts. (English) Zbl 1332.05134 J. Comb. Theory, Ser. B 118, 268-283 (2016). MSC: 05C83 05C05 05C70 PDFBibTeX XMLCite \textit{J. Carmesin} et al., J. Comb. Theory, Ser. B 118, 268--283 (2016; Zbl 1332.05134) Full Text: DOI arXiv
Aigner-Horev, Elad; Diestel, Reinhard; Postle, Luke The structure of 2-separations of infinite matroids. (English) Zbl 1327.05050 J. Comb. Theory, Ser. B 116, 25-56 (2016). MSC: 05B35 PDFBibTeX XMLCite \textit{E. Aigner-Horev} et al., J. Comb. Theory, Ser. B 116, 25--56 (2016; Zbl 1327.05050) Full Text: DOI arXiv
Carmesin, J.; Diestel, R.; Hamann, M.; Hundertmark, F. Canonical tree-decompositions of finite graphs. I: Existence and algorithms. (English) Zbl 1327.05269 J. Comb. Theory, Ser. B 116, 1-24 (2016). MSC: 05C70 05C05 05C40 PDFBibTeX XMLCite \textit{J. Carmesin} et al., J. Comb. Theory, Ser. B 116, 1--24 (2016; Zbl 1327.05269) Full Text: DOI arXiv
Diestel, Reinhard Forcing finite minors in sparse infinite graphs by large-degree assumptions. (English) Zbl 1308.05066 Electron. J. Comb. 22, No. 1, Research Paper P1.43, 11 p. (2015). MSC: 05C42 05C07 05C35 05C63 05C83 PDFBibTeX XMLCite \textit{R. Diestel}, Electron. J. Comb. 22, No. 1, Research Paper P1.43, 11 p. (2015; Zbl 1308.05066) Full Text: arXiv Link
Diestel, Reinhard; Oum, Sang-il Unifying duality theorems for width parameters in graphs and matroids (extended abstract). (English) Zbl 1409.05045 Kratsch, Dieter (ed.) et al., Graph-theoretic concepts in computer science. 40th international workshop, WG 2014, Nouan-le-Fuzelier, France, June 25–27, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8747, 1-14 (2014). MSC: 05B35 05C12 05C70 PDFBibTeX XMLCite \textit{R. Diestel} and \textit{S.-i. Oum}, Lect. Notes Comput. Sci. 8747, 1--14 (2014; Zbl 1409.05045) Full Text: DOI arXiv
Diestel, Reinhard; Pott, Julian Orthogonality and minimality in the homology of locally finite graphs. (English) Zbl 1301.05081 Electron. J. Comb. 21, No. 3, Research Paper P3.36, 9 p. (2014). MSC: 05C10 PDFBibTeX XMLCite \textit{R. Diestel} and \textit{J. Pott}, Electron. J. Comb. 21, No. 3, Research Paper P3.36, 9 p. (2014; Zbl 1301.05081) Full Text: arXiv Link
Carmesin, Johannes; Diestel, Reinhard; Hundertmark, Fabian; Stein, Maya Connectivity and tree structure in finite graphs. (English) Zbl 1324.05104 Combinatorica 34, No. 1, 11-45 (2014). Reviewer: Mirko Lepović (Kragujevac) MSC: 05C40 05C05 05C83 PDFBibTeX XMLCite \textit{J. Carmesin} et al., Combinatorica 34, No. 1, 11--45 (2014; Zbl 1324.05104) Full Text: DOI arXiv Link
Bruhn, Henning; Diestel, Reinhard; Kriesell, Matthias; Pendavingh, Rudi; Wollan, Paul Axioms for infinite matroids. (English) Zbl 1279.05013 Adv. Math. 239, 18-46 (2013). MSC: 05B35 PDFBibTeX XMLCite \textit{H. Bruhn} et al., Adv. Math. 239, 18--46 (2013; Zbl 1279.05013) Full Text: DOI arXiv
Diestel, Reinhard; Kawarabayashi, Ken-Ichi; Müller, Theodor; Wollan, Paul On the excluded minor structure theorem for graphs of large tree-width. (English) Zbl 1256.05229 J. Comb. Theory, Ser. B 102, No. 6, 1189-1210 (2012). MSC: 05C83 05C75 05C05 PDFBibTeX XMLCite \textit{R. Diestel} et al., J. Comb. Theory, Ser. B 102, No. 6, 1189--1210 (2012; Zbl 1256.05229) Full Text: DOI arXiv
Diestel, Reinhard; Kawarabayashi, Ken-Ichi; Wollan, Paul The Erdős-Pósa property for clique minors in highly connected graphs. (English) Zbl 1239.05172 J. Comb. Theory, Ser. B 102, No. 2, 454-469 (2012). MSC: 05C83 05C40 PDFBibTeX XMLCite \textit{R. Diestel} et al., J. Comb. Theory, Ser. B 102, No. 2, 454--469 (2012; Zbl 1239.05172) Full Text: DOI arXiv
Bruhn, Henning; Diestel, Reinhard Infinite matroids in graphs. (English) Zbl 1231.05055 Discrete Math. 311, No. 15, 1461-1471 (2011). Reviewer: Esther R. Lamken (San Francisco) MSC: 05B35 05C63 PDFBibTeX XMLCite \textit{H. Bruhn} and \textit{R. Diestel}, Discrete Math. 311, No. 15, 1461--1471 (2011; Zbl 1231.05055) Full Text: DOI arXiv
Diestel, Reinhard Locally finite graphs with ends: A topological approach. I: Basic theory. (English) Zbl 1223.05198 Discrete Math. 311, No. 15, 1423-1447 (2011). MSC: 05C63 05C10 57M15 PDFBibTeX XMLCite \textit{R. Diestel}, Discrete Math. 311, No. 15, 1423--1447 (2011; Zbl 1223.05198) Full Text: DOI
Diestel, Reinhard; Sprüssel, Philipp On the homology of locally compact spaces with ends. (English) Zbl 1257.55004 Topology Appl. 158, No. 13, 1626-1639 (2011). Reviewer: Bruce Hughes (Nashville) MSC: 55N35 05C63 05C38 PDFBibTeX XMLCite \textit{R. Diestel} and \textit{P. Sprüssel}, Topology Appl. 158, No. 13, 1626--1639 (2011; Zbl 1257.55004) Full Text: DOI arXiv
Diestel, Reinhard; Sprüssel, Philipp The fundamental group of a locally finite graph with ends. (English) Zbl 1298.05324 Adv. Math. 226, No. 3, 2643-2675 (2011). MSC: 05E15 PDFBibTeX XMLCite \textit{R. Diestel} and \textit{P. Sprüssel}, Adv. Math. 226, No. 3, 2643--2675 (2011; Zbl 1298.05324) Full Text: DOI arXiv
Bonato, Anthony; Bruhn, Henning; Diestel, Reinhard; Sprüssel, Philipp Twins of rayless graphs. (English) Zbl 1221.05039 J. Comb. Theory, Ser. B 101, No. 1, 60-65 (2011). MSC: 05C05 05C63 05C75 PDFBibTeX XMLCite \textit{A. Bonato} et al., J. Comb. Theory, Ser. B 101, No. 1, 60--65 (2011; Zbl 1221.05039) Full Text: DOI arXiv
Diestel, Reinhard; Sprüssel, Philipp The homology of a locally finite graph with ends. (English) Zbl 1240.05222 Combinatorica 30, No. 6, 681-714 (2010). Reviewer: Mirko Lepović (Kragujevac) MSC: 05C63 55N10 PDFBibTeX XMLCite \textit{R. Diestel} and \textit{P. Sprüssel}, Combinatorica 30, No. 6, 681--714 (2010; Zbl 1240.05222) Full Text: DOI
Diestel, Reinhard Locally finite graphs with ends: A topological approach. II: Applications. (English) Zbl 1223.05197 Discrete Math. 310, No. 20, 2750-2765 (2010). MSC: 05C63 05C10 05C35 PDFBibTeX XMLCite \textit{R. Diestel}, Discrete Math. 310, No. 20, 2750--2765 (2010; Zbl 1223.05197) Full Text: DOI arXiv
Bruhn, Henning; Diestel, Reinhard; Georgakopoulos, Agelos; Sprüssel, Philipp Every rayless graph has an unfriendly partition. (English) Zbl 1273.05153 Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 279-281 (2009). MSC: 05C63 05C70 PDFBibTeX XMLCite \textit{H. Bruhn} et al., Electron. Notes Discrete Math. 34, 279--281 (2009; Zbl 1273.05153) Full Text: DOI arXiv
Bruhn, Henning; Diestel, Reinhard MacLane’s theorem for arbitrary surfaces. (English) Zbl 1180.05036 J. Comb. Theory, Ser. B 99, No. 2, 275-286 (2009). Reviewer: Saul Stahl (Lawrence) MSC: 05C10 57M15 PDFBibTeX XMLCite \textit{H. Bruhn} and \textit{R. Diestel}, J. Comb. Theory, Ser. B 99, No. 2, 275--286 (2009; Zbl 1180.05036) Full Text: DOI Backlinks: MO
Diestel, Reinhard End spaces and spanning trees. (English) Zbl 1107.05028 J. Comb. Theory, Ser. B 96, No. 6, 846-854 (2006). MSC: 05C10 05C05 PDFBibTeX XMLCite \textit{R. Diestel}, J. Comb. Theory, Ser. B 96, No. 6, 846--854 (2006; Zbl 1107.05028) Full Text: DOI
Diestel, Reinhard; Kühn, Daniela Graph minor hierarchies. (English) Zbl 1055.05140 Discrete Appl. Math. 145, No. 2, 167-182 (2005). MSC: 05C83 05C70 PDFBibTeX XMLCite \textit{R. Diestel} and \textit{D. Kühn}, Discrete Appl. Math. 145, No. 2, 167--182 (2005; Zbl 1055.05140) Full Text: DOI
Diestel, Reinhard The Erdős-Menger conjecture for source/sink sets with disjoint closures. (English) Zbl 1059.05063 J. Comb. Theory, Ser. B 93, No. 1, 107-114 (2005). Reviewer: Jun-Ming Xu (Hefei) MSC: 05C40 PDFBibTeX XMLCite \textit{R. Diestel}, J. Comb. Theory, Ser. B 93, No. 1, 107--114 (2005; Zbl 1059.05063) Full Text: DOI
Diestel, Reinhard; Kühn, Daniela Topological paths, cycles and spanning trees in infinite graphs. (English) Zbl 1050.05071 Eur. J. Comb. 25, No. 6, 835-862 (2004). MSC: 05C38 05C05 05C10 PDFBibTeX XMLCite \textit{R. Diestel} and \textit{D. Kühn}, Eur. J. Comb. 25, No. 6, 835--862 (2004; Zbl 1050.05071) Full Text: DOI
Diestel, Reinhard On the problem of finding small subdivision and homomorphism bases for classes of countable graphs. (English) Zbl 0571.05042 Discrete Math. 55, 21-33 (1985). MSC: 05C75 PDFBibTeX XMLCite \textit{R. Diestel}, Discrete Math. 55, 21--33 (1985; Zbl 0571.05042) Full Text: DOI