{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T00:53:05Z","timestamp":1726447985501},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"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":8294,"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":[[1990,11]]},"DOI":"10.1016\/0012-365x(90)90161-a","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"43-52","source":"Crossref","is-referenced-by-count":3,"title":["The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices"],"prefix":"10.1016","volume":"85","author":[{"given":"Mao-cheng","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90161-A_BIB1","first-page":"137","article-title":"On graphs with at most three independent paths connecting any two vertices","volume":"1","author":"Bollob\u00e1s","year":"1966","journal-title":"Studia Sci. Math. Hungar"},{"year":"1978","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","key":"10.1016\/0012-365X(90)90161-A_BIB2"},{"key":"10.1016\/0012-365X(90)90161-A_BIB3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(82)90018-8","article-title":"Minimally k-connected graphs of low order and maximal size","volume":"41","author":"Cai","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90161-A_BIB4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01350130","article-title":"Existenz gewisser Konfigurationen in n-ges\u00e4ttigten Graphen und in Graphen gen\u00fcgend grosser Kantendichte","volume":"194","author":"Mader","year":"1971","journal-title":"Math. Ann."},{"key":"10.1016\/0012-365X(90)90161-A_BIB5","series-title":"Proc. 7th British Combinatorial Conf.","first-page":"66","article-title":"Connectivity and edge-connectivity in finite graphs","author":"Mader","year":"1979"},{"key":"10.1016\/0012-365X(90)90161-A_BIB6","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","article-title":"Zur allgemeinen Kurventheorie","volume":"10","author":"Menger","year":"1927","journal-title":"Fund. Math."},{"issue":"3","key":"10.1016\/0012-365X(90)90161-A_BIB7","first-page":"72","article-title":"Minimally k-line-connected graphs of low order with maximal size","author":"Su","year":"1984","journal-title":"J. Xinjiang University"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090161A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090161A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:55:32Z","timestamp":1555134932000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090161A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["0012365X9090161A"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90161-a","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}