{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T09:10:32Z","timestamp":1779354632102,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s10878-026-01418-3","type":"journal-article","created":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T14:56:55Z","timestamp":1778511415000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hamiltonian paths extending a set of matchings in hypercubes"],"prefix":"10.1007","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2654-9184","authenticated-orcid":false,"given":"Abid","family":"Ali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lina","family":"Ba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3827-7334","authenticated-orcid":false,"given":"Weihua","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,11]]},"reference":[{"key":"1418_CR1","doi-asserted-by":"publisher","first-page":"995","DOI":"10.3390\/sym17070995","volume":"17","author":"A Ali","year":"2025","unstructured":"Ali A, Yang W, Ali G, Popa I-L, Mitu DA (2025) Kinds of matchings extending to Hamiltonian cycles in hypercube networks. Symmetry 17:995. https:\/\/doi.org\/10.3390\/sym17070995","journal-title":"Symmetry"},{"key":"1418_CR2","volume-title":"Hypercubes and distributed computers","author":"F Andre","year":"1989","unstructured":"Andre F, Verjus JP (1989) Hypercubes and distributed computers. Horth-Halland, Amsterdam, New York"},{"key":"1418_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty UR (1976) Graph theory with applications. Macmillan Press, London"},{"key":"1418_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/jgt.20128","volume":"51","author":"R Caha","year":"2006","unstructured":"Caha R, Koubek V (2006) Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets. J Graph Theory 51:137\u2013169. https:\/\/doi.org\/10.1002\/jgt.20128","journal-title":"J Graph Theory"},{"key":"1418_CR5","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1016\/j.disc.2005.12.050","volume":"307","author":"R Caha","year":"2007","unstructured":"Caha R, Koubek V (2007) Spanning multi-paths in hypercubes. Discrete Math 307:2053\u20132066. https:\/\/doi.org\/10.1016\/j.disc.2005.12.050","journal-title":"Discrete Math"},{"key":"1418_CR6","doi-asserted-by":"publisher","unstructured":"Dimitrov D, Dvo\u0159\u00e1k T, Gregor P, \u0160krekovski R (2009) Gray codes avoiding matchings. Discrete Math Theor Comput Sci 11:123\u2013148. https:\/\/doi.org\/10.46298\/dmtcs.457","DOI":"10.46298\/dmtcs.457"},{"key":"1418_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/S0895480103432805","volume":"19","author":"T Dvo\u0159\u00e1k","year":"2005","unstructured":"Dvo\u0159\u00e1k T (2005) Hamiltonian cycles with prescribed edges in hypercubes. SIAM J Discrete Math 19:135\u2013144. https:\/\/doi.org\/10.1137\/S0895480103432805","journal-title":"SIAM J Discrete Math"},{"key":"1418_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1002\/jgt.22371","volume":"90","author":"T Dvo\u0159\u00e1k","year":"2019","unstructured":"Dvo\u0159\u00e1k T, Fink J (2019) Gray codes extending quadratic matchings. J Graph Theory 90:123\u2013136. https:\/\/doi.org\/10.1002\/jgt.22371","journal-title":"J Graph Theory"},{"key":"1418_CR9","doi-asserted-by":"publisher","first-page":"1982","DOI":"10.1016\/j.disc.2005.12.045","volume":"307","author":"T Dvo\u0159\u00e1k","year":"2007","unstructured":"Dvo\u0159\u00e1k T, Gregor P (2007) Hamiltonian paths with prescribed edges in hypercubes. Discrete Math 307:1982\u20131998. https:\/\/doi.org\/10.1016\/j.disc.2005.12.045","journal-title":"Discrete Math"},{"key":"1418_CR10","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1016\/j.jctb.2007.02.007","volume":"97","author":"J Fink","year":"2007","unstructured":"Fink J (2007) Perfect matchings extend to Hamilton cycles in hypercubes. J Combin Theory Ser B 97:1074\u20131076. https:\/\/doi.org\/10.1016\/j.jctb.2007.02.007","journal-title":"J Combin Theory Ser B"},{"key":"1418_CR11","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1016\/j.ejc.2009.03.007","volume":"30","author":"J Fink","year":"2009","unstructured":"Fink J (2009) Matching graphs of hypercubes and complete bipartite graphs. Eur J Combin 30:1624\u20131629. https:\/\/doi.org\/10.1016\/j.ejc.2009.03.007","journal-title":"Eur J Combin"},{"key":"1418_CR12","doi-asserted-by":"publisher","unstructured":"Fink J, Hotmar V (2025) Matchings of five directions in hypercube extends to Hamilton cycles and paths with prescribed ends. arXiv preprint arXiv:2501.19029. https:\/\/doi.org\/10.48550\/arXiv.2501.19029","DOI":"10.48550\/arXiv.2501.19029"},{"key":"1418_CR13","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1016\/j.disc.2008.02.013","volume":"309","author":"P Gregor","year":"2009","unstructured":"Gregor P (2009) Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes. Discrete Math 309:1711\u20131713. https:\/\/doi.org\/10.1016\/j.disc.2008.02.013","journal-title":"Discrete Math"},{"key":"1418_CR14","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/j.ipl.2008.07.015","volume":"108","author":"P Gregor","year":"2008","unstructured":"Gregor P, Dvo\u0159\u00e1k T (2008) Path partitions of hypercubes. Inf Process Lett 108:402\u2013406. https:\/\/doi.org\/10.1016\/j.ipl.2008.07.015","journal-title":"Inf Process Lett"},{"key":"1418_CR15","volume-title":"Th\u00e9orie du baguenodier","author":"L Gros","year":"1872","unstructured":"Gros L (1872) Th\u00e9orie du baguenodier. Aim\u00e9 Vingtrinier, Lyon, France"},{"key":"1418_CR16","doi-asserted-by":"crossref","unstructured":"Havel I (1984) On Hamiltonian circuits and spanning trees of hypercubes. \u010casopis P\u011bst Mat 109:135\u2013152. https:\/\/eudml.org\/doc\/19336","DOI":"10.21136\/CPM.1984.108506"},{"key":"1418_CR17","first-page":"87","volume":"16","author":"G Kreweras","year":"1996","unstructured":"Kreweras G (1996) Matchings and Hamiltonian cycles on hypercubes. Bull Inst Combin Appl 16:87\u201391","journal-title":"Bull Inst Combin Appl"},{"key":"1418_CR18","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1137\/0406012","volume":"6","author":"F Ruskey","year":"1993","unstructured":"Ruskey F, Savage C (1993) Hamilton cycles that extend transposition matchings in Cayley graphs of $$S_n$$. SIAM J Discrete Math 6:152\u2013166. https:\/\/doi.org\/10.1137\/0406012","journal-title":"SIAM J Discrete Math"},{"key":"1418_CR19","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C Savage","year":"1997","unstructured":"Savage C (1997) A survey of combinatorial Gray codes. SIAM Rev 39:605\u2013629. https:\/\/doi.org\/10.1137\/S0036144595295272","journal-title":"SIAM Rev"},{"key":"1418_CR20","unstructured":"Simmons GJ (1977) Almost all n-dimensional rectangular lattices are Hamilton-laceable. Presented at the 9th Southeastern Conference on Combinatoric Graph Theory and Computing"},{"key":"1418_CR21","doi-asserted-by":"publisher","first-page":"5590","DOI":"10.1016\/j.ins.2007.06.013","volume":"177","author":"C-H Tsai","year":"2007","unstructured":"Tsai C-H, Lai Y-C (2007) Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes. Inf Sci 177:5590\u20135597. https:\/\/doi.org\/10.1016\/j.ins.2007.06.013","journal-title":"Inf Sci"},{"key":"1418_CR22","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00373-015-1533-6","volume":"32","author":"F Wang","year":"2016","unstructured":"Wang F, Zhang H (2016) Small matchings extend to Hamiltonian cycles in hypercubes. Graphs Combin 32:363\u2013376. https:\/\/doi.org\/10.1007\/s00373-015-1533-6","journal-title":"Graphs Combin"},{"key":"1418_CR23","doi-asserted-by":"publisher","first-page":"217","DOI":"10.7151\/dmgt.2010","volume":"38","author":"F Wang","year":"2018","unstructured":"Wang F, Zhao W (2018) Matchings extend to Hamiltonian cycles in 5-cube. Discuss Math Graph Theory 38:217\u2013231. https:\/\/doi.org\/10.7151\/dmgt.2010","journal-title":"Discuss Math Graph Theory"},{"issue":"12","key":"1418_CR24","doi-asserted-by":"publisher","first-page":"33692","DOI":"10.3934\/math.20241608","volume":"9","author":"S Zhao","year":"2024","unstructured":"Zhao S, Wang F (2024) Hamiltonian paths passing through matchings in hypercubes with faulty edges. AIMS Math 9(12):33692\u201333711. https:\/\/doi.org\/10.3934\/math.20241608","journal-title":"AIMS Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01418-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-026-01418-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01418-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T08:43:12Z","timestamp":1779352992000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-026-01418-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["1418"],"URL":"https:\/\/doi.org\/10.1007\/s10878-026-01418-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"27 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2026","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 have no competing conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"43"}}