{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:22:11Z","timestamp":1746253331245},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"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":[[1992,9]]},"DOI":"10.1007\/bf02349962","type":"journal-article","created":{"date-parts":[[2006,4,9]],"date-time":"2006-04-09T09:36:43Z","timestamp":1144575403000},"page":"253-258","source":"Crossref","is-referenced-by-count":7,"title":["Counterexamples to a conjecture of mader about cycles through specified vertices inn-edge-connected graphs"],"prefix":"10.1007","volume":"8","author":[{"given":"Andreas","family":"Huck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haruko","family":"Okamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02349962_CR1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02582931","volume":"1","author":"W. Mader","year":"1985","unstructured":"Mader, W.: Paths in graphs, reducing the edge-connectivity only by two. Graphs Comb.1, 81\u201389 (1985)","journal-title":"Graphs Comb."},{"key":"BF02349962_CR2","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. of Comb. Theory (B),37, 151\u2013172 (1984)","journal-title":"J. of Comb. Theory (B)"},{"key":"BF02349962_CR3","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. of Comb. Theory (B),45, 345\u2013355 (1988)","journal-title":"J. of Comb. Theory (B)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02349962.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02349962\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02349962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T10:20:31Z","timestamp":1558088431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02349962"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["BF02349962"],"URL":"https:\/\/doi.org\/10.1007\/bf02349962","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}