{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:48:21Z","timestamp":1777600101950,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T00:00:00Z","timestamp":1772582400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T00:00:00Z","timestamp":1772582400000},"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 Supercomput"],"DOI":"10.1007\/s11227-026-08388-7","type":"journal-article","created":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T05:33:02Z","timestamp":1772602382000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hamiltonian laceability of hypercubes extending a set of matchings with disjoint faulty edges"],"prefix":"10.1007","volume":"82","author":[{"given":"Abid","family":"Ali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gohar","family":"Ali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weihua","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,4]]},"reference":[{"key":"8388_CR1","volume-title":"Th\u00e9orie du baguenodier","author":"L Gros","year":"1872","unstructured":"Gros L (1872) Th\u00e9orie du baguenodier. Aim\u00e9 Vingtrinier, Lyon"},{"key":"8388_CR2","doi-asserted-by":"crossref","unstructured":"Dimitrov D, Dvo\u0159\u00e1k T, Gregor P, \u0160krekovski R (2009) Gray codes avoiding matchings. Discret Math Theor Comput Sci 11(2), 123\u2013148. 10.46298\/dmtcs.457","DOI":"10.46298\/dmtcs.457"},{"issue":"1","key":"8388_CR3","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(1):135\u2013144. https:\/\/doi.org\/10.1137\/S0895480103432805","journal-title":"SIAM J Discrete Math"},{"key":"8388_CR4","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":"8388_CR5","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":"8388_CR6","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":"8388_CR7","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":"8388_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0020-0190(98)00159-8","volume":"68","author":"A Sengupta","year":"1998","unstructured":"Sengupta A (1998) On ring embedding in hypercubes with faulty nodes and links. Inform Proces Lett 68:207\u2013214. https:\/\/doi.org\/10.1016\/S0020-0190(98)00159-8","journal-title":"Inform Proces Lett"},{"issue":"4","key":"8388_CR9","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1137\/0404045","volume":"4","author":"M-Y Chan","year":"1991","unstructured":"Chan M-Y, Lee S-J (1991) On the existence of Hamiltonian circuits in faulty hypercubes. SIAM J Discrete Math 4(4):511\u2013527. https:\/\/doi.org\/10.1137\/0404045","journal-title":"SIAM J Discrete Math"},{"key":"8388_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.ipl.2008.02.016","volume":"107","author":"W-Q Wang","year":"2008","unstructured":"Wang W-Q, Chen X-B (2008) A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges. Inform Proces Lett 107:205\u2013210. https:\/\/doi.org\/10.1016\/j.ipl.2008.02.016","journal-title":"Inform Proces Lett"},{"key":"8388_CR11","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1007\/s11464-019-0810-8","volume":"14","author":"X-B Chen","year":"2019","unstructured":"Chen X-B (2019) Matchings extend to Hamiltonian cycles in hypercubes with faulty edges. Front Math China 14:1117\u20131132. https:\/\/doi.org\/10.1007\/s11464-019-0810-8","journal-title":"Front Math China"},{"key":"8388_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.115027","volume":"1028","author":"D Xiang","year":"2025","unstructured":"Xiang D, Hsieh SY (2025) G-good-neighbor diagnosability under the modified comparison model for multiprocessor systems. Theoret Comp Sci 1028:115027. https:\/\/doi.org\/10.1016\/j.tcs.2024.115027","journal-title":"Theoret Comp Sci"},{"key":"8388_CR13","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.dam.2024.07.030","volume":"357","author":"M Wang","year":"2024","unstructured":"Wang M, Xiang D, Qu Y, Li G (2024) The diagnosability of interconnection networks. Discrete Appl Math 357:413\u2013428. https:\/\/doi.org\/10.1016\/j.dam.2024.07.030","journal-title":"Discrete Appl Math"},{"key":"8388_CR14","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.tcs.2012.11.028","volume":"475","author":"CN Kuo","year":"2013","unstructured":"Kuo CN, Chou HH, Chang NW, Hsieh SY (2013) Fault-tolerant path embedding in folded hypercubes with both node and edge faults. Theor Comput Sci 475:82\u201391. https:\/\/doi.org\/10.1016\/j.tcs.2012.11.028","journal-title":"Theor Comput Sci"},{"key":"8388_CR15","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1007\/11602613_108","volume-title":"International Symposium on Algorithms and Computation","author":"J Fan","year":"2005","unstructured":"Fan J, Lin X, Jia X, Lau RW (2005) Edge-pancyclicity of twisted cubes. International Symposium on Algorithms and Computation. Berlin, Heidelberg, Springer, Berlin Heidelberg, pp 1090\u20131099"},{"key":"8388_CR16","unstructured":"Simmons GJ (1978) Almost all n-dimensional rectangular lattices are Hamilton-laceable. In: Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory & Computing (Florida Atlantic Univ., Boca Raton, FL), pp. 649\u2013661"},{"key":"8388_CR17","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":"8388_CR18","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":"8388_CR19","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/jgt.20128","volume":"51","author":"R Caha","year":"2005","unstructured":"Caha R, Koubek V (2005) 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":"8388_CR20","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":"8388_CR21","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":"8388_CR22","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.dam.2024.11.030","volume":"363","author":"F Wang","year":"2025","unstructured":"Wang F, Zhang H (2025) Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges. Discrete Appl Math 363:16\u201326. https:\/\/doi.org\/10.1016\/j.dam.2024.11.030","journal-title":"Discrete Appl Math"},{"key":"8388_CR23","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":"8388_CR24","unstructured":"Ali A, Ba L, Yang W (2025) Hamiltonian paths extending a set of matchings in hypercubes. arXiv preprint arXiv:2506.21432. 10.48550\/arXiv. 2506.21432"},{"key":"8388_CR25","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.dam.2017.10.005","volume":"236","author":"F Wang","year":"2018","unstructured":"Wang F, Zhang H (2018) Hamiltonian laceability in hypercubes with faulty edges. Discrete Appl Math 236:438\u2013445. https:\/\/doi.org\/10.1016\/j.dam.2017.10.005","journal-title":"Discrete Appl Math"},{"issue":"12","key":"8388_CR26","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"},{"key":"8388_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"J Bondy","year":"1976","unstructured":"Bondy J, Murty U (1976) Graph theory with applications. Macmillan Press, London"},{"key":"8388_CR28","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":"8388_CR29","doi-asserted-by":"publisher","first-page":"135","DOI":"10.21136\/CPM.1984.108506","volume":"109","author":"I Havel","year":"1984","unstructured":"Havel I (1984) On Hamiltonian circuits and spanning trees of hypercubes. \u010casopis pro p\u011bstov\u00e1n\u00ed matematiky 109:135\u2013152","journal-title":"\u010casopis pro p\u011bstov\u00e1n\u00ed matematiky"},{"key":"8388_CR30","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":"8388_CR31","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. Inform Process Lett 108:402\u2013406. https:\/\/doi.org\/10.1016\/j.ipl.2008.07.015","journal-title":"Inform Process Lett"},{"key":"8388_CR32","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.ipl.2011.10.010","volume":"112","author":"X-B Chen","year":"2012","unstructured":"Chen X-B (2012) Paired many-to-many disjoint path covers of hypercubes with faulty edges. Inform Process Lett 112:61\u201366. https:\/\/doi.org\/10.1016\/j.ipl.2011.10.010","journal-title":"Inform Process Lett"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08388-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08388-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08388-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T05:33:04Z","timestamp":1772602384000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08388-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,4]]},"references-count":32,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2026,3]]}},"alternative-id":["8388"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08388-7","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,4]]},"assertion":[{"value":"10 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 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 declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"218"}}