{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T04:40:06Z","timestamp":1777869606925,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T00:00:00Z","timestamp":1777507200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T00:00:00Z","timestamp":1777507200000},"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-08544-z","type":"journal-article","created":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T14:12:45Z","timestamp":1777558365000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hamiltonian laceability with a set of faulty edges in hypercubes"],"prefix":"10.1007","volume":"82","author":[{"given":"Abid","family":"Ali","sequence":"first","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,4,30]]},"reference":[{"key":"8544_CR1","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":"8544_CR2","unstructured":"Simmons GJ (1977) Almost all n-dimensional rectangular lattices are Hamilton-laceable. In: Proc. 9th Southeastern Conf. Combinatorics, Graph Theory Comput"},{"key":"8544_CR3","volume-title":"Th\u00e9orie du baguenodier","author":"L Gros","year":"1872","unstructured":"Gros L (1872) Th\u00e9orie du baguenodier. Aim\u00e9 Vingtrinier, Lyon"},{"key":"8544_CR4","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. \u010cas P\u011bst Mat 109:135\u2013152","journal-title":"\u010cas P\u011bst Mat"},{"key":"8544_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s10878-008-9205-6","volume":"20","author":"N Casta\u00f1eda","year":"2010","unstructured":"Casta\u00f1eda N, Gotchev IS (2010) Embedded paths and cycles in faulty hypercubes. J Comb Optim 20:224\u2013248. https:\/\/doi.org\/10.1007\/s10878-008-9205-6","journal-title":"J Comb Optim"},{"key":"8544_CR6","doi-asserted-by":"publisher","first-page":"3774","DOI":"10.1016\/j.tcs.2010.06.011","volume":"411","author":"T Dvo\u0159\u00e1k","year":"2010","unstructured":"Dvo\u0159\u00e1k T, Koubek V (2010) Computational complexity of long paths and cycles in faulty hypercubes. Theor Comput Sci 411:3774\u20133786. https:\/\/doi.org\/10.1016\/j.tcs.2010.06.011","journal-title":"Theor Comput Sci"},{"key":"8544_CR7","doi-asserted-by":"publisher","first-page":"3634","DOI":"10.1016\/j.ins.2009.06.011","volume":"179","author":"J Fink","year":"2009","unstructured":"Fink J, Gregor P (2009) Long paths and cycles in hypercubes with faulty vertices. Inf Sci 179:3634\u20133644. https:\/\/doi.org\/10.1016\/j.ins.2009.06.011","journal-title":"Inf Sci"},{"key":"8544_CR8","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.ins.2008.10.015","volume":"179","author":"T-L Kueng","year":"2009","unstructured":"Kueng T-L, Liang T, Hsu L-H, Tan JJM (2009) Long paths in hypercubes with conditional node-faults. Inf Sci 179:667\u2013681. https:\/\/doi.org\/10.1016\/j.ins.2008.10.015","journal-title":"Inf Sci"},{"key":"8544_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ins.2012.02.017","volume":"215","author":"A Szepietowski","year":"2012","unstructured":"Szepietowski A (2012) Hamiltonian cycles in hypercubes with 2n\u20134 faulty edges. Inf Sci 215:75\u201382. https:\/\/doi.org\/10.1016\/j.ins.2012.02.017","journal-title":"Inf Sci"},{"key":"8544_CR10","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0020-0190(02)00214-4","volume":"83","author":"C-H Tsai","year":"2002","unstructured":"Tsai C-H, Tan JJM, Liang T, Hsu L-H (2002) Fault-tolerant Hamiltonian laceability of hypercubes. Inf Process Lett 83:301\u2013306. https:\/\/doi.org\/10.1016\/S0020-0190(02)00214-4","journal-title":"Inf Process Lett"},{"key":"8544_CR11","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.dam.2017.11.015","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.11.015","journal-title":"Discrete Appl Math"},{"key":"8544_CR12","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/s11227-026-08388-7","volume":"82","author":"A Ali","year":"2026","unstructured":"Ali A, Ali G, Yang W (2026) Hamiltonian laceability of hypercubes extending a set of matchings with disjoint faulty edges. J Supercomput 82:218. https:\/\/doi.org\/10.1007\/s11227-026-08388-7","journal-title":"J Supercomput"},{"key":"8544_CR13","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.endm.2007.07.074","volume":"29","author":"T Dvo\u0159\u00e1k","year":"2007","unstructured":"Dvo\u0159\u00e1k T, Gregor P (2007) Hamiltonian fault-tolerance of hypercubes. Electron Notes Discrete Math 29:471\u2013477. https:\/\/doi.org\/10.1016\/j.endm.2007.07.074","journal-title":"Electron Notes Discrete Math"},{"key":"8544_CR14","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1137\/0404045","volume":"4","author":"MY Chan","year":"1991","unstructured":"Chan MY, Lee S-J (1991) On the existence of Hamiltonian circuits in faulty hypercubes. SIAM J Discrete Math 4:511\u2013527. https:\/\/doi.org\/10.1137\/0404045","journal-title":"SIAM J Discrete Math"},{"key":"8544_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.ins.2013.09.012","volume":"256","author":"J-J Liu","year":"2014","unstructured":"Liu J-J, Wang Y-L (2014) Hamiltonian cycles in hypercubes with faulty edges. Inf Sci 256:225\u2013233. https:\/\/doi.org\/10.1016\/j.ins.2013.09.012","journal-title":"Inf Sci"},{"key":"8544_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1142\/S0129054121500039","volume":"32","author":"C Li","year":"2021","unstructured":"Li C, Lin S, Li S (2021) Hamiltonian cycle embeddings in faulty hypercubes under the forbidden faulty set model. Int J Found Comput Sci 32:53\u201372. https:\/\/doi.org\/10.1142\/S0129054121500039","journal-title":"Int J Found Comput Sci"},{"key":"8544_CR17","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.tcs.2004.01.035","volume":"314","author":"C-H Tsai","year":"2004","unstructured":"Tsai C-H (2004) Linear array and ring embeddings in conditional faulty hypercubes. Theor Comput Sci 314:431\u2013443. https:\/\/doi.org\/10.1016\/j.tcs.2004.01.035","journal-title":"Theor Comput Sci"},{"key":"8544_CR18","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 USR (1976) Graph theory with applications. Macmillan Press, London"},{"key":"8544_CR19","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":"8544_CR20","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":"8544_CR21","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.1709","DOI":"10.46298\/dmtcs.1709"},{"key":"8544_CR22","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.ipl.2011.10.010","volume":"112","author":"XB Chen","year":"2012","unstructured":"Chen XB (2012) Paired many-to-many disjoint path covers of hypercubes with faulty edges. Inf Process Lett 112:61\u201366. https:\/\/doi.org\/10.1016\/j.ipl.2011.10.010","journal-title":"Inf Process Lett"},{"key":"8544_CR23","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"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08544-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08544-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08544-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T14:12:47Z","timestamp":1777558367000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08544-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,30]]},"references-count":23,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2026,4]]}},"alternative-id":["8544"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08544-z","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,30]]},"assertion":[{"value":"3 December 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 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":"386"}}