{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T05:26:31Z","timestamp":1767245191660},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,1,30]],"date-time":"2014-01-30T00:00:00Z","timestamp":1391040000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s00493-014-2898-5","type":"journal-article","created":{"date-parts":[[2014,1,30]],"date-time":"2014-01-30T03:57:39Z","timestamp":1391054259000},"page":"11-46","source":"Crossref","is-referenced-by-count":29,"title":["Connectivity and tree structure in finite graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Johannes","family":"Carmesin","sequence":"first","affiliation":[]},{"given":"Reinhard","family":"Diestel","sequence":"additional","affiliation":[]},{"given":"Fabian","family":"Hundertmark","sequence":"additional","affiliation":[]},{"given":"Maya","family":"Stein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,1,30]]},"reference":[{"key":"2898_CR1","volume-title":"Canonical tree-decompositions of finite graphs I. Existence and algorithms","author":"J Carmesin","year":"2013","unstructured":"J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: Canonical tree-decompositions of finite graphs I. Existence and algorithms, arXiv:1305.4668, 2013."},{"key":"2898_CR2","volume-title":"Canonical tree-decompositions of finite graphs II. The parts","author":"J Carmesin","year":"2013","unstructured":"J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: Canonical tree-decompositions of finite graphs II. The parts, arXiv:1305.4909, 2013."},{"key":"2898_CR3","volume-title":"k-Blocks: a connectivity invariant for graphs","author":"J Carmesin","year":"2009","unstructured":"J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: k-Blocks: a connectivity invariant for graphs, arXiv:1305.4557, 2009"},{"key":"2898_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R Diestel","year":"2010","unstructured":"R. Diestel: Graph Theory, Springer, 4th edition, 2010.","edition":"4th edition"},{"key":"2898_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1006\/jctb.1998.1862","volume":"75","author":"R Diestel","year":"1999","unstructured":"R. Diestel, K. Yu. Gorbunov, T. Jensen and C. Thomassen: Highly connected sets and the excluded grid theorem, J. Combin. Theory (Series B), 75 (1999), 61\u201373.","journal-title":"J. Combin. Theory (Series B)"},{"key":"2898_CR6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF02579278","volume":"2","author":"M J Dunwoody","year":"1982","unstructured":"M. J. Dunwoody: Cutting up graphs, Combinatorica, 2 (1982), 15\u201323.","journal-title":"Combinatorica"},{"key":"2898_CR7","volume-title":"Vertex cuts","author":"M J Dunwoody","year":"2009","unstructured":"M. J. Dunwoody and B. Kr\u00f6n: Vertex cuts, arXiv:0905.0064, 2009."},{"key":"2898_CR8","volume-title":"Profiles. An algebraic approach to combinatorial connectivity","author":"F Hundertmark","year":"2011","unstructured":"F. Hundertmark: Profiles. An algebraic approach to combinatorial connectivity, arXiv:1110.6207, 2011."},{"key":"2898_CR9","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/S0095-8956(78)80012-4","volume":"25","author":"W Mader","year":"1978","unstructured":"W. Mader: \u00dcber n-fach zusammenh\u00e4ngende Eckenmengen in Graphen, J. Combin. Theory (Series B), 25 (1978), 74\u201393.","journal-title":"J. Combin. Theory (Series B)"},{"key":"2898_CR10","volume-title":"Surveys in Combinatorics","author":"B A Reed","year":"1997","unstructured":"B. A. Reed: Tree width and tangles: a new connectivity measure and some applications. In: Surveys in Combinatorics (editor R. A. Bailey, Cambridge Univ. Press, 1997."},{"key":"2898_CR11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N Robertson","year":"1991","unstructured":"N. Robertson and P. D. Seymour: Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory (Series B), 52 (1991), 153\u2013190.","journal-title":"J. Combin. Theory (Series B)"},{"key":"2898_CR12","volume-title":"Graph Theory","author":"W T Tutte","year":"1984","unstructured":"W. T. Tutte: Graph Theory, Addison-Wesley, 1984."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2898-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-2898-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2898-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:50Z","timestamp":1559079170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-2898-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,30]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["2898"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-2898-5","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,30]]}}}