{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T00:52:26Z","timestamp":1726447946865},"reference-count":5,"publisher":"Elsevier BV","issue":"3","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)90018-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:31:50Z","timestamp":1027639910000},"page":"229-234","source":"Crossref","is-referenced-by-count":6,"title":["Minimally k-connected graphs of low order and maximal size"],"prefix":"10.1016","volume":"41","author":[{"given":"Cai","family":"Mao-cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1978","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","key":"10.1016\/0012-365X(82)90018-8_BIB1"},{"key":"10.1016\/0012-365X(82)90018-8_BIB2","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1073\/pnas.48.7.1142","article-title":"The maximum connectivity of a graph","volume":"48","author":"Harary","year":"1962","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"10.1016\/0012-365X(82)90018-8_BIB3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01304873","article-title":"Ecken vom Grad n in minimalen n-fach zusammenh\u00e4ngenden Graphen","volume":"23","author":"Mader","year":"1972","journal-title":"Archiv. Math."},{"key":"10.1016\/0012-365X(82)90018-8_BIB4","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/BF01304933","article-title":"\u00dcber minimal n-fach zusammenh\u00e4ngende, unendliche Graphen und ein Extremalproblem","volume":"23","author":"Mader","year":"1972","journal-title":"Arch. Math."},{"key":"10.1016\/0012-365X(82)90018-8_BIB5","first-page":"66","article-title":"Connectivity and edge-connectivity in finite graphs","author":"Mader","year":"1979","journal-title":"Proc. 7th British Combinatorial Conf."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X82900188?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X82900188?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:26:18Z","timestamp":1555140378000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X82900188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982]]}},"alternative-id":["0012365X82900188"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(82)90018-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1982]]}}}