{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T20:42:45Z","timestamp":1698093765430},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1007\/bf01787639","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T18:58:01Z","timestamp":1119207481000},"page":"323-351","source":"Crossref","is-referenced-by-count":12,"title":["A sufficient condition for graphs to be weaklyk-linked"],"prefix":"10.1007","volume":"7","author":[{"given":"Andreas","family":"Huck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01787639_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/mana.19790930116","volume":"93","author":"W. Mader","year":"1979","unstructured":"Mader, W.: Eine Reduktionsmethode f\u00fcr den Kantenzusammenhang in Graphen Math. Nachr.93, 187\u2013204 (1979)","journal-title":"Nachr."},{"key":"BF01787639_CR2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.4099\/math1924.10.99","volume":"10","author":"H. Okamura","year":"1984","unstructured":"Okamura, H.: Multicommodity Flows in Graphs II. Japan. J. Math.10, 99\u2013116 (1984)","journal-title":"Japan. J. Math."},{"key":"BF01787639_CR3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0095-8956(84)90069-8","volume":"37","author":"H. Okamura","year":"1984","unstructured":"Okamura, H.: Paths and Edge-Connectivity in Graphs. J. Comb. Theory (B)37, 151\u2013172 (1984)","journal-title":"J. Comb. Theory (B)"},{"key":"BF01787639_CR4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0095-8956(88)90077-9","volume":"45","author":"H. Okamura","year":"1988","unstructured":"Okamura, H.: Paths ink-Edge-Connected Graphs. J. Comb. Theory (B)45, 345\u2013355 (1988)","journal-title":"J. Comb. Theory (B)"},{"key":"BF01787639_CR5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01787729","volume":"6","author":"H. Okamura","year":"1990","unstructured":"Okamura, H.: Every 4k-Edge-Connected Graph is weakly 3k-linked. Graphs and Combinatorics6, 179\u2013185 (1990)","journal-title":"Graphs and Combinatorics"},{"key":"BF01787639_CR6","unstructured":"Okamura, H.: Every 6k-Edge-Connected Graph is weakly 5k-linked. Preliminary version"},{"key":"BF01787639_CR7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0195-6698(80)80039-4","volume":"1","author":"C. Thomassen","year":"1980","unstructured":"Thomassen, C.: 2-Linked Graphs. Europ. J. Comb.1, 371\u2013378 (1980)","journal-title":"Europ. J. Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01787639.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01787639\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01787639","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T13:12:19Z","timestamp":1557493939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01787639"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["BF01787639"],"URL":"https:\/\/doi.org\/10.1007\/bf01787639","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}