{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T08:41:13Z","timestamp":1767861673978,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"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":11520,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1982]]},"DOI":"10.1016\/0012-365x(82)90206-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:31:50Z","timestamp":1027654310000},"page":"181-198","source":"Crossref","is-referenced-by-count":9,"title":["On some extremal connectivity results for graphs and matroids"],"prefix":"10.1016","volume":"41","author":[{"given":"James G.","family":"Oxley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(82)90206-0_BIB1","series-title":"London Math. Soc. Monographs","article-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0012-365X(82)90206-0_BIB2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0012-365X(82)90206-0_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0002-9947-1971-0288039-7","article-title":"A combinatorial model for series-parallel networks","volume":"154","author":"Brylawski","year":"1971","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(82)90206-0_BIB4","first-page":"204","article-title":"Minimally 2-connected graphs","volume":"228","author":"Dirac","year":"1967","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/0012-365X(82)90206-0_BIB5","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/S0021-9800(69)80049-9","article-title":"A theorem on n-connected graphs","volume":"7","author":"Halin","year":"1969","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(82)90206-0_BIB6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF02992931","article-title":"Zur Theorie der n-fach zusammenh\u00e4ngenden Graphen","volume":"33","author":"Halin","year":"1969","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0012-365X(82)90206-0_BIB7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01350321","article-title":"Untersuchungen \u00fcber minimale n-fach zusammenh\u00e4ngende Graphen","volume":"182","author":"Halin","year":"1969","journal-title":"Math. Ann."},{"key":"10.1016\/0012-365X(82)90206-0_BIB8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02950646","article-title":"Zur Struktur minimal n-fach zusammenh\u00e4ngender Graphen","volume":"49","author":"Mader","year":"1979","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0012-365X(82)90206-0_BIB9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0012-365X(74)90109-5","article-title":"Extremal critically connected matroids","volume":"8","author":"Murty","year":"1974","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/0012-365X(82)90206-0_BIB10","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1093\/qmath\/32.2.193","article-title":"On matroid connectivity","volume":"32","author":"Oxley","year":"1981","journal-title":"Quart. J. Math. Oxford"},{"key":"10.1016\/0012-365X(82)90206-0_BIB11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1090\/S0002-9947-1981-0607106-5","article-title":"On connectivity in matroids and graphs","volume":"265","author":"Oxley","year":"1981","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(82)90206-0_BIB12","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\/0012-365X(82)90206-0_BIB13","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S1385-7258(61)50045-5","article-title":"A theory of 3-connected graphs","volume":"64","author":"Tutte","year":"1961","journal-title":"Nederl. Akad. Wetensch. Proc."},{"key":"10.1016\/0012-365X(82)90206-0_BIB14","doi-asserted-by":"crossref","first-page":"1301","DOI":"10.4153\/CJM-1966-129-2","article-title":"Connectivity in matroids","volume":"18","author":"Tutte","year":"1966","journal-title":"Canad. J. Math"},{"key":"10.1016\/0012-365X(82)90206-0_BIB15","series-title":"London Math. Soc. Monographs","article-title":"Matroid Theory","author":"Welsh","year":"1976"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X82902060?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X82902060?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:25:57Z","timestamp":1555154757000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X82902060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982]]}},"alternative-id":["0012365X82902060"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(82)90206-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1982]]}}}