{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:22:18Z","timestamp":1746253338274},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T00:00:00Z","timestamp":1272326400000},"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":[[2010,7]]},"DOI":"10.1007\/s00373-010-0932-y","type":"journal-article","created":{"date-parts":[[2010,4,26]],"date-time":"2010-04-26T00:01:14Z","timestamp":1272240074000},"page":"571-589","source":"Crossref","is-referenced-by-count":1,"title":["2-Reducible Two Paths and an Edge Constructing a Path in (2k + 1)-Edge-Connected Graphs"],"prefix":"10.1007","volume":"26","author":[{"given":"Haruko","family":"Okamura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,4,27]]},"reference":[{"key":"932_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 Math. 101, 49\u201357 (1992)","journal-title":"Discrete Math."},{"key":"932_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 Comb. 8, 253\u2013258 (1992)","journal-title":"Graphs Comb."},{"key":"932_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":"932_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 in k-edge-connected graphs. J. Comb. Theory Ser. B 45, 345\u2013355 (1988)","journal-title":"J. Comb. Theory Ser. B"},{"key":"932_CR5","first-page":"549","volume-title":"Topics in Combinatorics and Graph Theory","author":"H. Okamura","year":"1991","unstructured":"Okamura H.: Cycles containing three consecutive edges in 2k-edge-connected graphs. In: Bodendiek, R., Henn, R. (eds) Topics in Combinatorics and Graph Theory, pp. 549\u2013553. Physica-Verlag, Heidelberg (1991)"},{"key":"932_CR6","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\u00a0+\u00a01)-edge-connected graphs. Contem. Math. 147, 259\u2013277 (1993)","journal-title":"Contem. Math."},{"key":"932_CR7","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\u00a0+\u00a01)-edge-connected graphs. Graphs Comb. 11, 141\u2013170 (1995)","journal-title":"Graphs Comb."},{"key":"932_CR8","first-page":"211","volume":"61","author":"H. Okamura","year":"2001","unstructured":"Okamura H.: 2-reducible paths containing a specified edge in (2k\u00a0+\u00a01)-edge-connected graphs. ARS Combinatria 61, 211\u2013220 (2001)","journal-title":"ARS Combinatria"},{"key":"932_CR9","first-page":"13","volume":"75","author":"H. Okamura","year":"2005","unstructured":"Okamura H.: Two paths joining given vertices in (2k\u00a0+\u00a01)-edge-connected graphs. ARS Combinatoria 75, 13\u201331 (2005)","journal-title":"ARS Combinatoria"},{"key":"932_CR10","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s00373-005-0626-z","volume":"21","author":"H. Okamura","year":"2005","unstructured":"Okamura H.: Two paths joining given vertices in 2k-edge-connected graphs. Graphs and Comb. 21, 503\u2013514 (2005)","journal-title":"Graphs and Comb."},{"key":"932_CR11","unstructured":"Okamura, H.: 2-Reducible two paths and two edges constructing a cycle in (2k\u00a0+\u00a01)-edge-connected graphs (in preparation)"},{"key":"932_CR12","unstructured":"Okamura, H.: 2-Reducible two paths and an edge constructing a path in 2k-edge-connected graphs (in preparation)"},{"key":"932_CR13","unstructured":"Okamura, H.: 2-Reducible two paths and two edges constructing a cycle in 2k-edge-connected graphs (in preparation)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0932-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0932-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0932-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:30Z","timestamp":1559041110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0932-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,27]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["932"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0932-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,27]]}}}