{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:22:07Z","timestamp":1746253327644},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"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":10516,"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":[[1984,10]]},"DOI":"10.1016\/0095-8956(84)90069-8","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:35:48Z","timestamp":1103679348000},"page":"151-172","source":"Crossref","is-referenced-by-count":17,"title":["Paths and edge-connectivity in graphs"],"prefix":"10.1016","volume":"37","author":[{"given":"Haruko","family":"Okamura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(84)90069-8_BIB1","series-title":"Proceedings, 12th Annual ACM Symposium on Theory of Computing","first-page":"211","article-title":"An approach to the k paths problem","author":"Cypher","year":"1980"},{"key":"10.1016\/0095-8956(84)90069-8_BIB2","article-title":"Weakly 4-Linked Graphs","author":"Enomoto","year":"1983"},{"key":"10.1016\/0095-8956(84)90069-8_BIB3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0095-8956(84)90015-7","article-title":"A sufficient condition for a graph to be weakly k-linked","volume":"36","author":"Hirata","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(84)90069-8_BIB4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70504-1","article-title":"A reduction method for edge-connectivity in graphs","volume":"3","author":"Mader","year":"1978","journal-title":"Ann. of Discrete Math."},{"key":"10.1016\/0095-8956(84)90069-8_BIB5","first-page":"266","article-title":"Three commodity flows in graphs","volume":"59","author":"Okamura","year":"1983"},{"key":"10.1016\/0095-8956(84)90069-8_BIB6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.4099\/math1924.10.99","article-title":"Multicommodity flows in graphs II","volume":"10","author":"Okamura","year":"1984","journal-title":"Japan. J. Math."},{"key":"10.1016\/0095-8956(84)90069-8_BIB7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(80)90158-2","article-title":"Disjoint paths in graphs","volume":"29","author":"Seymour","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(84)90069-8_BIB8","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0195-6698(80)80039-4","article-title":"2-Linked graphs","volume":"1","author":"Thomassen","year":"1980","journal-title":"European J. Combin."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895684900698?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895684900698?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:38Z","timestamp":1548881558000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895684900698"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["0095895684900698"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(84)90069-8","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1984,10]]}}}