{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:22:13Z","timestamp":1746253333135},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s00373-005-0626-z","type":"journal-article","created":{"date-parts":[[2006,1,30]],"date-time":"2006-01-30T11:48:23Z","timestamp":1138621703000},"page":"503-514","source":"Crossref","is-referenced-by-count":2,"title":["Two Paths Joining Given Vertices in 2k-Edge-Connected Graphs"],"prefix":"10.1007","volume":"21","author":[{"given":"Haruko","family":"Okamura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"626_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0012-365X(92)90589-8","volume":"101","author":"A. Frank","year":"1992","unstructured":"Frank, A.: On a theorem of Mader. Discrete Mathematics 101, 49\u201357 (1992)","journal-title":"Discrete Mathematics"},{"key":"626_CR2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF02349962","volume":"8","author":"A. Huck","year":"1992","unstructured":"Huck, A., Okamura, H.: Counterexamples to a conjecture of Mader about cycles through specified vertices in n-edge-connected graphs. Graphs and Comb. 8, 253\u2013258 (1992)","journal-title":"Graphs and Comb."},{"key":"626_CR3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70504-1","volume":"3","author":"W. Mader","year":"1978","unstructured":"Mader, W.: A reduction method for edge-connectivity in graphs. Ann. Discrete Math. 3, 145\u2013164 (1978)","journal-title":"Ann. Discrete Math."},{"key":"626_CR4","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 Ser. B 37, 151\u2013172 (1984)","journal-title":"J. Comb. Theory Ser. B"},{"key":"626_CR5","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 in k-edge-connected graphs. J. Comb. Theory Ser. B 45, 345\u2013355 (1988)","journal-title":"J. Comb. Theory Ser. B"},{"key":"626_CR6","doi-asserted-by":"crossref","unstructured":"Okamura, H.: Cycles containing three consecutive edges in 2k-edge-connected graphs, Topics in Combinatorics and Graph Theory (eds. R. Bodendiek and R. Henn), (Physica-Verlag Heidelberg, 1991), 549\u2013553","DOI":"10.1007\/978-3-642-46908-4_62"},{"key":"626_CR7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1090\/conm\/147\/01178","volume":"147","author":"H Okamura","year":"1993","unstructured":"Okamura, H.: 2-reducible cycles containing two specified edges in (2k+1)-edge-connected graphs, Contemporary Math. 147, 259\u2013277 (1993)","journal-title":"Contemporary Math."},{"key":"626_CR8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01929484","volume":"11","author":"H Okamura","year":"1995","unstructured":"Okamura, H.: 2-reducible cycles containing three consecutive edges in (2k+1)-edge-connected graphs, Graphs and Comb. 11, 141\u2013170 (1995)","journal-title":"Graphs and Comb."},{"key":"626_CR9","first-page":"211","volume":"61","author":"H Okamura","year":"2001","unstructured":"Okamura, H.: 2-reducible paths containing a specified edge in (2k+1)-edge-connected graphs, ARS Combinatoria 61, 211\u2013220 (2001)","journal-title":"ARS Combinatoria"},{"key":"626_CR10","first-page":"13","volume":"75","author":"H. Okamura","year":"2005","unstructured":"Okamura, H.: Two paths joining given vertices in (2k+1)-edge-connected graphs, Ars Combinatoria 75, 13\u201331 (2005)","journal-title":"Ars Combinatoria"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0626-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-005-0626-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0626-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0626-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T04:02:15Z","timestamp":1652500935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-005-0626-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["626"],"URL":"https:\/\/doi.org\/10.1007\/s00373-005-0626-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}