{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T20:43:33Z","timestamp":1698093813022},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,2,1]],"date-time":"1984-02-01T00:00:00Z","timestamp":444441600000},"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":10759,"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,2]]},"DOI":"10.1016\/0095-8956(84)90015-7","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:35:48Z","timestamp":1103679348000},"page":"85-94","source":"Crossref","is-referenced-by-count":9,"title":["A sufficient condition for a graph to be weakly k-linked"],"prefix":"10.1016","volume":"36","author":[{"given":"Tomio","family":"Hirata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiyohito","family":"Kubota","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Osami","family":"Saito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(84)90015-7_BIB1","author":"Berge","year":"1966"},{"key":"10.1016\/0095-8956(84)90015-7_BIB2","series-title":"Proceedings, 12th Annual ACM Symposium on Theory of Computing","first-page":"211","article-title":"An Approach to k paths problem","author":"Cypher","year":"1980"},{"key":"10.1016\/0095-8956(84)90015-7_BIB3","unstructured":"H. Enomoto and A. Saito, Weakly 4-linked graphs, private communication."},{"key":"10.1016\/0095-8956(84)90015-7_BIB4","doi-asserted-by":"crossref","unstructured":"H. Okamura, Multicommodity flows in graphs II, Japan. J. Math., to appear.","DOI":"10.4099\/math1924.10.99"},{"key":"10.1016\/0095-8956(84)90015-7_BIB5","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":"Europ. J. Combin."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895684900157?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895684900157?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:53:19Z","timestamp":1548881599000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895684900157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,2]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,2]]}},"alternative-id":["0095895684900157"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(84)90015-7","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1984,2]]}}}