{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:21:34Z","timestamp":1765164094705,"version":"3.46.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T00:00:00Z","timestamp":1760745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T00:00:00Z","timestamp":1760745600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP20K03720","JP21K03342","JP20K14353"],"award-info":[{"award-number":["JP20K03720","JP21K03342","JP20K14353"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s00373-025-02978-7","type":"journal-article","created":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T09:38:01Z","timestamp":1760780281000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Degree conditions of two vertices with distance two or three for the existence of a Hamilton cycle passing through a matching in a bipartite graph"],"prefix":"10.1007","volume":"41","author":[{"given":"Shuya","family":"Chiba","sequence":"first","affiliation":[]},{"given":"Masao","family":"Tsugaki","sequence":"additional","affiliation":[]},{"given":"Tomoki","family":"Yamashita","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3378-4740","authenticated-orcid":false,"given":"Takamasa","family":"Yashima","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,18]]},"reference":[{"key":"2978_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0012-365X(93)90136-H","volume":"111","author":"D Amar","year":"1993","unstructured":"Amar, D.: Applying a condition for a hamiltonian bipartite graph to be bipancyclic. Discrete Math. 111, 19\u201325 (1993)","journal-title":"Discrete Math."},{"key":"2978_CR2","doi-asserted-by":"publisher","first-page":"1525","DOI":"10.1016\/j.disc.2005.11.090","volume":"307","author":"D Amar","year":"2007","unstructured":"Amar, D., Flandrin, E., Gancarzewicz, G., Wojda, A.P.: Bipartite graphs with every matching in a cycle. Discrete Math. 307, 1525\u20131537 (2007)","journal-title":"Discrete Math."},{"key":"2978_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/(SICI)1097-0118(199606)22:2<181::AID-JGT9>3.0.CO;2-J","volume":"22","author":"J Bang-Jensen","year":"1996","unstructured":"Bang-Jensen, J., Gutin, G., Li, H.: Sufficient conditions for a digraph to be hamiltonian. J. Graph Theory 22, 181\u2013187 (1996)","journal-title":"J. Graph Theory"},{"key":"2978_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)"},{"key":"2978_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0095-8956(84)90054-6","volume":"37","author":"G Fan","year":"1984","unstructured":"Fan, G.: New sufficient conditions for cycles in graphs. J. Combin. Theory Ser. B 37, 221\u2013227 (1984)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2978_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113692","volume":"347","author":"J Fujisawa","year":"2024","unstructured":"Fujisawa, J., Tsugaki, M., Yamashita, T., Yashima, T.: Hamilton cycles passing through a matching in a bipartite graph with high degree sum. Discrete Math. 347, 113692 (2024)","journal-title":"Discrete Math."},{"key":"2978_CR7","unstructured":"Las Vergnas, M.: Probl\u00e8mes de couplages et probl\u00e8mes hamiltoniens en th\u00e9orie des graphes, Ph.D.\u00a0Thesis, Universit\u00e9 Paris VI, (1972)"},{"key":"2978_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02759704","volume":"1","author":"JW Moon","year":"1963","unstructured":"Moon, J.W., Moser, L.: On hamiltonian bipartite graphs. Israel J. Math. 1, 163\u2013165 (1963)","journal-title":"Israel J. Math."},{"key":"2978_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"O Ore","year":"1960","unstructured":"Ore, O.: Note on hamilton circuits. Amer. Math. Monthly 67, 55 (1960)","journal-title":"Amer. Math. Monthly"},{"key":"2978_CR10","first-page":"181","volume":"136","author":"M Wang","year":"2018","unstructured":"Wang, M., Liu, Y.: Bipartite graphs with every $$k$$-matching in a hamiltonian cycle. Ars Combin. 136, 181\u2013197 (2018)","journal-title":"Ars Combin."},{"key":"2978_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113446","volume":"346","author":"R Wang","year":"2023","unstructured":"Wang, R., Zhou, Z.: Degree sum condition on distance 2 vertices for hamiltonian cycles in balanced bipartite graphs. Discrete Math. 346, 113446 (2023)","journal-title":"Discrete Math."},{"key":"2978_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.20627","volume":"71","author":"R Zamani","year":"2012","unstructured":"Zamani, R., West, D.B.: Spanning cycles through specified edges in bipartite graphs. J. Graph Theory 71, 1\u201317 (2012)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02978-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02978-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02978-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:20:23Z","timestamp":1765164023000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02978-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,18]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2978"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02978-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,10,18]]},"assertion":[{"value":"8 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"118"}}