{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:40:04Z","timestamp":1746254404504,"version":"3.40.4"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T00:00:00Z","timestamp":1739232000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T00:00:00Z","timestamp":1739232000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s00373-024-02873-7","type":"journal-article","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T18:43:22Z","timestamp":1739299402000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["2-Reducible Two Paths and Two Edges Constructing a Cycle in $$(2k+1)$$-Edge-Connected Graphs"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-4051-6388","authenticated-orcid":false,"given":"Haruko","family":"Okamura","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,11]]},"reference":[{"key":"2873_CR1","doi-asserted-by":"publisher","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":"2873_CR2","doi-asserted-by":"publisher","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":"2873_CR3","doi-asserted-by":"publisher","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":"2873_CR4","doi-asserted-by":"publisher","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":"2873_CR5","doi-asserted-by":"publisher","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":"2873_CR6","first-page":"549","volume-title":"Cycles Containing Three Consecutive Edges in $$2k$$-Edge-connected graphs. Topics in Combinatorics and Graph Theory","author":"H Okamura","year":"1991","unstructured":"Okamura, H.: Cycles Containing Three Consecutive Edges in $$2k$$-Edge-connected graphs. Topics in Combinatorics and Graph Theory, pp. 549\u2013553. Physica-Verlag, Heidelberg (1991)"},{"key":"2873_CR7","doi-asserted-by":"publisher","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. Contemp. Math. 147, 259\u2013277 (1993)","journal-title":"Contemp. Math."},{"key":"2873_CR8","doi-asserted-by":"publisher","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 Comb. 11, 141\u2013170 (1995)","journal-title":"Graphs Comb."},{"key":"2873_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 Comb. 61, 211\u2013220 (2001)","journal-title":"Ars Comb."},{"key":"2873_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 Comb. 75, 13\u201331 (2005)","journal-title":"Ars Comb."},{"key":"2873_CR11","doi-asserted-by":"publisher","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 Comb. 21, 503\u2013514 (2005)","journal-title":"Graphs Comb."},{"key":"2873_CR12","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s00373-010-0932-y","volume":"26","author":"H Okamura","year":"2010","unstructured":"Okamura, H.: 2-reducible two paths and an edge constructing a path in $$(2k+1)$$-edge-connected graphs. Graphs Comb. 26, 571\u2013589 (2010)","journal-title":"Graphs Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02873-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02873-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02873-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:16:53Z","timestamp":1746253013000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02873-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,11]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2873"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02873-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,2,11]]},"assertion":[{"value":"28 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"35"}}