{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T21:16:38Z","timestamp":1776374198851,"version":"3.51.2"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T00:00:00Z","timestamp":1552435200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s00493-018-3572-0","type":"journal-article","created":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T11:31:45Z","timestamp":1552476705000},"page":"545-596","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["All Graphs Have Tree-Decompositions Displaying Their Topological Ends"],"prefix":"10.1007","volume":"39","author":[{"given":"Johannes","family":"Carmesin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,13]]},"reference":[{"key":"3572_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00493-011-2572-0","volume":"31","author":"E. Berger","year":"2011","unstructured":"E. Berger and H. Bruhn: Eulerian edge sets in locally finite graphs, Combinatorica\n                           31 (2011), 21\u201338.","journal-title":"Combinatorica"},{"key":"3572_CR2","volume-title":"Infinite matroids and determinacy of games","author":"N. Bowler","year":"2013","unstructured":"N. Bowler and J. Carmesin: Infinite matroids and determinacy of games, Preprint 2013, current version available at http:\/\/arxiv.org\/abs\/1301.5980."},{"key":"3572_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s00493-007-2149-0","volume":"27","author":"H. Bruhn","year":"2007","unstructured":"H. Bruhn and M. Stein: On end degrees and infinite circuits in locally finite graphs, Combinatorica\n                           27 (2007), 269\u2013291.","journal-title":"Combinatorica"},{"key":"3572_CR4","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF01456699","volume":"73","author":"C. Carath\u00e9odory","year":"1913","unstructured":"C. Carath\u00e9odory: \u00dcber die Begrenzung einfach zusammenh\u00e4ngender Gebiete, Math. Ann.\n                           73 (1913), 323\u2013370.","journal-title":"Math. Ann."},{"key":"3572_CR5","volume-title":"All graphs have tree-decompositions displaying their topological ends","author":"J. Carmesin","year":"2015","unstructured":"J. Carmesin: All graphs have tree-decompositions displaying their topological ends, Preprint 2015, available at http:\/\/arxiv.org\/pdf\/1409.6640v4."},{"key":"3572_CR6","volume-title":"On the end structure of infinite graphs","author":"J. Carmesin","year":"2014","unstructured":"J. Carmesin: On the end structure of infinite graphs, Preprint 2014, available at http:\/\/arxiv.org\/pdf\/1409.6640v1."},{"key":"3572_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.ejc.2016.04.007","volume":"58","author":"J. Carmesin","year":"2016","unstructured":"J. Carmesin: A short proof that every finite graph has a tree-decomposition displaying its tangles, European J. Combin.\n                           58 (2016), 61\u201365.","journal-title":"European J. Combin."},{"key":"3572_CR8","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.ejc.2016.09.008","volume":"60","author":"J. Carmesin","year":"2017","unstructured":"J. Carmesin: Topological cycle matroids of infinite graphs, European J. Combin\n                           60 (2017), 135\u2013150.","journal-title":"European J. Combin"},{"key":"3572_CR9","doi-asserted-by":"publisher","first-page":"1876","DOI":"10.1137\/130923646","volume":"28","author":"J. Carmesin","year":"2014","unstructured":"J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: k-blocks: a connectivity invariant for graphs, SIAM J. Discrete Math.\n                           28 (2014), 1876\u20131891.","journal-title":"SIAM J. Discrete Math."},{"key":"3572_CR10","first-page":"1","volume-title":"J. Combin. Theory (Series B)","author":"J. Carmesin","year":"2016","unstructured":"J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: Canonical tree decompositions of finite graphs I: Existence and algorithms, J. Combin. Theory (Series B) (2016), 1\u201324."},{"key":"3572_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s00493-014-2898-5","volume":"34","author":"J. Carmesin","year":"2014","unstructured":"J. Carmesin, R. Diestel, F. Hundertmark and M. Stein: Connectivity and treestructure in finite graphs, Combinatorica\n                           34 (2014), 11\u201346.","journal-title":"Combinatorica"},{"key":"3572_CR12","unstructured":"R. Diestel: Locally finite graphs with ends: a topological approach, http:\/\/arxiv.org \/abs\/0912.4213."},{"key":"3572_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0012-365X(92)90650-5","volume":"100","author":"R. Diestel","year":"1992","unstructured":"R. Diestel: The end structure of a graph: Recent results and open problems, Disc. Math.\n                           100 (1992), 313\u2013327.","journal-title":"Disc. Math."},{"key":"3572_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R. Diestel","year":"2010","unstructured":"R. Diestel: Graph Theory (4th edition), Springer-Verlag, 2010, Electronic edition available at: http:\/\/diestel-graph-theory.com\/index.html."},{"key":"3572_CR15","volume-title":"Graph Theory","author":"R. Diestel","year":"2016","unstructured":"R. Diestel: Graph Theory (5th edition), Springer-Verlag, 2016. Electronic edition available at: http:\/\/diestel-graph-theory.com\/index.html."},{"key":"3572_CR16","volume-title":"Abhandlungen Math. Sem. Univ. Hamburg","author":"R. Diestel","year":"2017","unstructured":"R. Diestel: Ends and tangles, Abhandlungen Math. Sem. Univ. Hamburg, 2017."},{"key":"3572_CR17","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0095-8956(02)00034-5","volume":"87","author":"R. Diestel","year":"2003","unstructured":"R. Diestel and D. K\u00fchn: Graph-theoretical versus topological ends of graphs, J. Combin. Theory (Series B)\n                           87 (2003), 197\u2013206.","journal-title":"J. Combin. Theory (Series B)"},{"key":"3572_CR18","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/s00493-004-0005-z","volume":"24","author":"R. Diestel","year":"2004","unstructured":"R. Diestel and D. K\u00fchn: On infinite cycles I, Combinatorica\n                           24 (2004), 68\u201389.","journal-title":"Combinatorica"},{"key":"3572_CR19","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00493-004-0005-z","volume":"24","author":"R. Diestel","year":"2004","unstructured":"R. Diestel and D. K\u00fchn: On infinite cycles II, Combinatorica\n                           24 (2004), 91\u2013116.","journal-title":"Combinatorica"},{"key":"3572_CR20","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1007\/BF01174375","volume":"33","author":"H. Freudenthal","year":"1931","unstructured":"H. Freudenthal: \u00dcber die Enden topologischer R\u00e1ume und Gruppen, Math. Zeitschr.\n                           33 (1931), 692\u2013713.","journal-title":"Math. Zeitschr."},{"key":"3572_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02566233","volume":"17","author":"H. Freudenthal","year":"1945","unstructured":"H. Freudenthal: \u00dcber die Enden diskreter R\u00e1ume und Gruppen, Comment. Math. Helv.\n                           17 (1945), 1\u201338.","journal-title":"Comment. Math. Helv."},{"key":"3572_CR22","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1016\/j.aim.2008.09.014","volume":"220","author":"A. Georgakopoulos","year":"2009","unstructured":"A. Georgakopoulos: Infinite Hamilton cycles in squares of locally finite graphs, Advances in Mathematics\n                           220 (2009), 670\u2013705.","journal-title":"Advances in Mathematics"},{"key":"3572_CR23","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01362670","volume":"157","author":"R. Halin","year":"1964","unstructured":"R. Halin: \u00dcber unendliche Wege in Graphen, Math. Annalen\n                           157 (1964), 125\u2013137.","journal-title":"Math. Annalen"},{"key":"3572_CR24","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF02950767","volume":"61","author":"R. Halin","year":"1991","unstructured":"R. Halin: Lattices of cuts in graphs, Abh. Math. Sem. Univ. Hamburg\n                           61 (1991), 217\u2013230.","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"3572_CR25","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s00493-012-2694-z","volume":"32","author":"M. Hamann","year":"2012","unstructured":"M. Hamann and J. Pott: Transitivity conditions in infinite graphs, Combinatorica\n                           32 (2012), 649\u2013688.","journal-title":"Combinatorica"},{"key":"3572_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526299","volume-title":"Ends of complexes, Cambridge Tracts in Mathematics","author":"B. Hughes","year":"1996","unstructured":"B. Hughes and A. Ranicki: Ends of complexes, Cambridge Tracts in Mathematics 123, Cambridge Univ. Press, 1996."},{"key":"3572_CR27","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1090\/S0002-9939-1991-1045600-8","volume":"113","author":"P. Seymour","year":"1991","unstructured":"P. Seymour and R. Thomas: An end-faithful spanning tree counterexample, Proc. Amer. Math. Soc.\n                           113 (1991), 1163\u20131171.","journal-title":"Proc. Amer. Math. Soc."},{"key":"3572_CR28","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.jctb.2005.08.003","volume":"96","author":"M. Stein","year":"2006","unstructured":"M. Stein: Arboriticity and tree-packing in locally finite graphs, J. Combin. Theory (Series B)\n                           96 (2006), 302\u2013312.","journal-title":"J. Combin. Theory (Series B)"},{"key":"3572_CR29","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1090\/S0002-9947-1989-0932450-9","volume":"312","author":"R. Thomas","year":"1989","unstructured":"R. Thomas: Well-quasi-ordering infinite graphs with forbidden finite planar minor, Trans. Amer. Math. Soc.\n                           312 (1989), 279\u2013313.","journal-title":"Trans. Amer. Math. Soc."},{"key":"3572_CR30","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/0095-8956(92)90059-7","volume":"54","author":"C. Thomassen","year":"1992","unstructured":"C. Thomassen: Infinite connected graphs with no end-preserving spanning trees, J. Combin. Theory (Series B)\n                           54 (1992), 322\u2013324.","journal-title":"J. Combin. Theory (Series B)"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-018-3572-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-018-3572-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-018-3572-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T00:15:16Z","timestamp":1583972116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-018-3572-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,13]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["3572"],"URL":"https:\/\/doi.org\/10.1007\/s00493-018-3572-0","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,13]]},"assertion":[{"value":"25 January 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}