{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T07:41:12Z","timestamp":1683013272377},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"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":[[1993,3]]},"DOI":"10.1007\/bf01202787","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T15:51:34Z","timestamp":1108741894000},"page":"7-30","source":"Crossref","is-referenced-by-count":2,"title":["Decomposition of 3-connected graphs"],"prefix":"10.1007","volume":"13","author":[{"given":"Collette R.","family":"Coullard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. Leslie","family":"Gardner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donald K.","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Bixby, R. E.: Composition and decomposition of matroids and related topics, Ph. D. thesis, Cornell University. 1972."},{"key":"CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J. A. Bondy","year":"1976","unstructured":"Bondy, J. A., andU. S. R. Murty:Graph Theory with Applications. American Elsevier, New York. 1976."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02591867","volume":"26","author":"G. Cornu\ufffdjols","year":"1983","unstructured":"Cornu\ufffdjols, G., D. Naddef, andW. R. Pulleyblank: Halin graphs and the traveling salesman problem.Mathematical Programming 26 (1983), 287?294.","journal-title":"Mathematical Programming"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","volume":"32","author":"W. H. Cunningham","year":"1980","unstructured":"Cunningham, W. H., andJ. Edmonds: A combinatorial decomposition theory,Canadian Journal of Mathematics 32 (1980), 734?765.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0095-8956(86)90074-2","volume":"40","author":"R. W. Dawes","year":"1986","unstructured":"Dawes, R. W.: Minimally 3-connected graphs,Journal of Combinatorial Theory (B) 40 (1986), 159?168.","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"CR6","first-page":"91","volume-title":"Recent Progress in Combinatorics","author":"R. Halin","year":"1969","unstructured":"Halin, R.: On the structure onn-connected graphs. In:Recent Progress in Combinatorics, 91?102. Academic Press, New York, 1969."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01350321","volume":"182","author":"R. Halin","year":"1969","unstructured":"Halin, R.: Untersuchungen \ufffdber minimalen-fach zusammenhangende graphen,Mathematische Annalen 182 (1969), 175?188.","journal-title":"Mathematische Annalen"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"Hopcroft, J. E., andR. E. Tarjan: Dividing a graph into triconnected componentsSIAM Journal on Computing 2 (1973), 135?158.","journal-title":"SIAM Journal on Computing"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1109\/SFCS.1987.33","volume-title":"28th Annual Symposium on Foundations of Computer Science","author":"A. Kanevsky","year":"1987","unstructured":"Kanevsky A., andV. Ramachandran: Improved algorithms for graph fourconnectivity, In:28th Annual Symposium on Foundations of Computer Science, 252?259. IEEE, New York. 1987."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1215\/S0012-7094-37-00336-3","volume":"3","author":"S. MacLane","year":"1937","unstructured":"MacLane, S.: A structural characterization of planar combinatorial graphs,Duke Mathematics Journal 3 (1937), 460?472.","journal-title":"Duke Mathematics Journal"},{"key":"CR11","first-page":"201","volume":"249","author":"W. Mader","year":"1971","unstructured":"Mader, W.: Minimalen-fach zusammenhangende graphen mit maximaler kantenzahl,Journal f\ufffdr die reine angewandte Mathematik 249 (1971), 201?207.","journal-title":"Journal f\ufffdr die reine angewandte Mathematik"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01304873","volume":"23","author":"W. Mader","year":"1972","unstructured":"Mader, W.: Ecken vom gradn in minimalemn-fach zusammenhangenden graphen,Archiv der Mathematik 23 (1972), 219?224.","journal-title":"Archiv der Mathematik"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K. Menger","year":"1927","unstructured":"Menger, K.: Zur allgemeinen Kurventheorie,Fundamenta Mathematicae 10 (1927), 96?115.","journal-title":"Fundamenta Mathematicae"},{"key":"CR14","unstructured":"Rajan, A.: Algorithmic implications of connectivity and related topics in matroid theory, Ph. D. Thesis, Northwestern University. 1986."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1090\/S0002-9947-1984-0743738-4","volume":"284","author":"N. Robertson","year":"1984","unstructured":"Robertson, N.: Minimal cyclic-4-connected graphs,Transactions of the American Mathematical Society 284 (1984), 665?687.","journal-title":"Transactions of the American Mathematical Society"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"P. D. Seymour","year":"1980","unstructured":"Seymour, P. D.: Decomposition of regular matroids,Journal of Combinatorial Theory (B) 28 (1980), 305?359.","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0095-8956(85)90037-1","volume":"39","author":"K. Truemper","year":"1985","unstructured":"Truemper, K.: A decomposition theory for matroids. I. General results,Journal of Combinatorial Theory (B) 39 (1985), 43?76.","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"CR18","doi-asserted-by":"crossref","DOI":"10.3138\/9781487584863","volume-title":"Connectivity in Graphs","author":"W. T. Tutte","year":"1966","unstructured":"Tutte, W. T.:Connectivity in Graphs. University of Toronto Press, Toronto. 1966."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","volume":"34","author":"H. Whitney","year":"1932","unstructured":"Whitney, H.: Non-separable and planar graphs,Transactions of the American Mathematical Society 34 (1932), 339?362.","journal-title":"Transactions of the American Mathematical Society"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202787.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01202787\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202787","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T07:06:25Z","timestamp":1683011185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01202787"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01202787"],"URL":"https:\/\/doi.org\/10.1007\/bf01202787","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}