{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T22:24:56Z","timestamp":1780352696447,"version":"3.54.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9969,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1986,4]]},"DOI":"10.1016\/0095-8956(86)90074-2","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:35:48Z","timestamp":1103679348000},"page":"159-168","source":"Crossref","is-referenced-by-count":14,"title":["Minimally 3-connected graphs"],"prefix":"10.1016","volume":"40","author":[{"given":"Robin W","family":"Dawes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(86)90074-2_BIB1","series-title":"Many Facets of Graph Theory","article-title":"On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs","volume":"Vol. 110","author":"Barnette","year":"1969"},{"key":"10.1016\/0095-8956(86)90074-2_BIB2","author":"Berge","year":"1973"},{"key":"10.1016\/0095-8956(86)90074-2_BIB3","author":"Bollobas","year":"1978"},{"key":"10.1016\/0095-8956(86)90074-2_BIB4","first-page":"273","article-title":"Minimally k-connected graphs, for k = 1, 2, and 3","volume":"39","author":"Dawes","year":"1983"},{"key":"10.1016\/0095-8956(86)90074-2_BIB5","first-page":"204","article-title":"Minimally 2-connected graphs","volume":"228","author":"Dirac","year":"1967","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/0095-8956(86)90074-2_BIB6","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1109\/TCT.1970.1083185","article-title":"Connectivity considerations in the design of survivable networks","volume":"CT17","author":"Frank","year":"1970","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0095-8956(86)90074-2_BIB7","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1109\/TCT.1969.1082940","article-title":"An algorithm for construction of the least vulnerable communication network or the graph with the maximum connectivity","volume":"CT16","author":"Hakimi","year":"1969","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0095-8956(86)90074-2_BIB8","series-title":"Proceedings, 3rd Waterloo Conference on Combinatorics","first-page":"91","article-title":"On the structure of n-connected graphs","author":"Halin","year":"1969"},{"key":"10.1016\/0095-8956(86)90074-2_BIB9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01350321","article-title":"Untersuchungen uber minimale n-fach zusammenhangende graphen","volume":"182","author":"Halin","year":"1969","journal-title":"Math. Ann"},{"key":"10.1016\/0095-8956(86)90074-2_BIB10","series-title":"Proceedings, 2nd Louisiana Conference on Combinatorics, Graph Theory and Computing","first-page":"257","article-title":"Characterizations and constructions of minimally 2-connected graphs and minimally strong digraphs","author":"Hedetniemi","year":"1971"},{"key":"10.1016\/0095-8956(86)90074-2_BIB11","first-page":"201","article-title":"Minimale n-fach zusammenhangende graphen mit maximaler kantenzahl","volume":"249","author":"Mader","year":"1971","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/0095-8956(86)90074-2_BIB12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01304873","article-title":"Ecken vom grad n in minimalen n-fach zusammenhangenden graphen","volume":"23","author":"Mader","year":"1972","journal-title":"Arch. Math."},{"key":"10.1016\/0095-8956(86)90074-2_BIB13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1090\/S0002-9947-1968-0228369-8","article-title":"On minimal blocks","volume":"134","author":"Plummer","year":"1968","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0095-8956(86)90074-2_BIB14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0095-8956(74)90034-3","article-title":"A classification of 4-connected graphs","volume":"17","author":"Slater","year":"1974","journal-title":"J. Combin. Theory Ser. (B)"},{"key":"10.1016\/0095-8956(86)90074-2_BIB15","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/TCT.1969.1083004","article-title":"The design of minimum-cost survivable networks","volume":"CT16","author":"Steiglitz","year":"1969","journal-title":"IEEE Trnas. Circuit Theory"},{"key":"10.1016\/0095-8956(86)90074-2_BIB16","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S1385-7258(61)50045-5","article-title":"A theory of 3-connected graphs","volume":"23","author":"Tutte","year":"1961","journal-title":"Indag. Math."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895686900742?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895686900742?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:52:30Z","timestamp":1548881550000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895686900742"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["0095895686900742"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(86)90074-2","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}