{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:42:00Z","timestamp":1767339720825,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_2","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"14-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Matchings in\u00a0Hypercubes Extend to\u00a0Long Cycles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5065-1213","authenticated-orcid":false,"given":"Ji\u0159\u00ed","family":"Fink","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6383-7436","authenticated-orcid":false,"given":"Torsten","family":"M\u00fctze","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"issue":"1","key":"2_CR1","first-page":"241","volume":"17","author":"A Alahmadi","year":"2015","unstructured":"Alahmadi, A., Aldred, R.E.L., Alkenani, A., Hijazi, R., Sol\u00e9, P., Thomassen, C.: Extending a perfect matching to a Hamiltonian cycle. Discrete Math. Theor. Comput. Sci. 17(1), 241\u2013254 (2015)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"3","key":"2_CR2","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, I.S.: Embedded paths and cycles in faulty hypercubes. J. Comb. Optim. 20(3), 224\u2013248 (2010). https:\/\/doi.org\/10.1007\/s10878-008-9205-6","journal-title":"J. Comb. Optim."},{"issue":"4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1137\/0404045","volume":"4","author":"MY Chan","year":"1991","unstructured":"Chan, M.Y., Lee, S.J.: On the existence of Hamiltonian circuits in faulty hypercubes. SIAM J. Discrete Math. 4(4), 511\u2013527 (1991). https:\/\/doi.org\/10.1137\/0404045","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"2_CR4","first-page":"123","volume":"11","author":"D Dimitrov","year":"2009","unstructured":"Dimitrov, D., Dvo\u0159\u00e1k, T., Gregor, P., \u0160krekovski, R.: Gray codes avoiding matchings. Discrete Math. Theor. Comput. Sci. 11(2), 123\u2013147 (2009)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"1","key":"2_CR5","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.: Hamiltonian cycles with prescribed edges in hypercubes. SIAM J. Discrete Math. 19(1), 135\u2013144 (2005). https:\/\/doi.org\/10.1137\/S0895480103432805","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"2_CR6","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.: Gray codes extending quadratic matchings. J. Graph Theory 90(2), 123\u2013136 (2019). https:\/\/doi.org\/10.1002\/jgt.22371","journal-title":"J. Graph Theory"},{"issue":"16","key":"2_CR7","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.: Hamiltonian paths with prescribed edges in hypercubes. Discrete Math. 307(16), 1982\u20131998 (2007). https:\/\/doi.org\/10.1016\/j.disc.2005.12.045","journal-title":"Discrete Math."},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Felsner, S., Trotter, W.T.: Colorings of diagrams of interval orders and $$\\alpha $$-sequences of sets, vol.\u00a0144, pp. 23\u201331 (1995). https:\/\/doi.org\/10.1016\/0012-365X(94)00283-O. Combinatorics of ordered sets (Oberwolfach, 1991)","DOI":"10.1016\/0012-365X(94)00283-O"},{"issue":"6","key":"2_CR9","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.: Perfect matchings extend to Hamilton cycles in hypercubes. J. Combin. Theory Ser. B 97(6), 1074\u20131076 (2007). https:\/\/doi.org\/10.1016\/j.jctb.2007.02.007","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00493-017-3731-8","volume":"39","author":"J Fink","year":"2019","unstructured":"Fink, J.: Matchings extend into 2-factors in hypercubes. Combinatorica 39(1), 77\u201384 (2019). https:\/\/doi.org\/10.1007\/s00493-017-3731-8","journal-title":"Combinatorica"},{"key":"2_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2020.103111","volume":"88","author":"J Fink","year":"2020","unstructured":"Fink, J.: Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle. Eur. J. Combin. 88, 103111 (2020). https:\/\/doi.org\/10.1016\/j.ejc.2020.103111","journal-title":"Eur. J. Combin."},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/s10878-011-9379-1","volume":"24","author":"J Fink","year":"2012","unstructured":"Fink, J., Gregor, P.: Long cycles in hypercubes with optimal number of faulty vertices. J. Comb. Optim. 24(3), 240\u2013265 (2012). https:\/\/doi.org\/10.1007\/s10878-011-9379-1","journal-title":"J. Comb. Optim."},{"key":"2_CR13","unstructured":"Fink, J., M\u00fctze, T.: Matchings in hypercubes extend to long cycles (2024). Full preprint of the present article available at https:\/\/arxiv.org\/abs\/2401.01769"},{"issue":"6","key":"2_CR14","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.: Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes. Discrete Math. 309(6), 1711\u20131713 (2009). https:\/\/doi.org\/10.1016\/j.disc.2008.02.013","journal-title":"Discrete Math."},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Gregor, P., Novotn\u00fd, T., \u0160krekovski, R.: Extending perfect matchings to Gray codes with prescribed ends. Electron. J. Combin. 25(2), Paper No. 2.56, 18 p (2018). https:\/\/doi.org\/10.37236\/6928","DOI":"10.37236\/6928"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.jcta.2003.11.004","volume":"105","author":"JR Johnson","year":"2004","unstructured":"Johnson, J.R.: Long cycles in the middle two layers of the discrete cube. J. Combin. Theory Ser. A 105(2), 255\u2013271 (2004). https:\/\/doi.org\/10.1016\/j.jcta.2003.11.004","journal-title":"J. Combin. Theory Ser. A"},{"key":"2_CR17","first-page":"87","volume":"16","author":"G Kreweras","year":"1996","unstructured":"Kreweras, G.: Matchings and Hamiltonian cycles on hypercubes. Bull. Inst. Combin. Appl. 16, 87\u201391 (1996)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Latifi, S., Zheng, S.Q., Bagherzadeh, N.: Optimal ring embedding in hypercubes with faulty links. In: Digest of Papers: FTCS-22, The Twenty-Second Annual International Symposium on Fault-Tolerant Computing, Boston, Massachusetts, USA, 8\u201310 July 1992, pp. 178\u2013184. IEEE Computer Society (1992). https:\/\/doi.org\/10.1109\/FTCS.1992.243602","DOI":"10.1109\/FTCS.1992.243602"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.ins.2013.09.012","volume":"256","author":"JJ Liu","year":"2014","unstructured":"Liu, J.J., Wang, Y.L.: Hamiltonian cycles in hypercubes with faulty edges. Inform. Sci. 256, 225\u2013233 (2014). https:\/\/doi.org\/10.1016\/j.ins.2013.09.012","journal-title":"Inform. Sci."},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"M\u00fctze, T.: Proof of the middle levels conjecture. Proc. Lond. Math. Soc. (3) 112(4), 677\u2013713 (2016). https:\/\/doi.org\/10.1112\/plms\/pdw004","DOI":"10.1112\/plms\/pdw004"},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1137\/0406012","volume":"6","author":"F Ruskey","year":"1993","unstructured":"Ruskey, F., Savage, C.: Hamilton cycles that extend transposition matchings in Cayley graphs of $$S_n$$. SIAM J. Discrete Math. 6(1), 152\u2013166 (1993). https:\/\/doi.org\/10.1137\/0406012","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"2_CR22","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/0097-3165(95)90091-8","volume":"70","author":"CD Savage","year":"1995","unstructured":"Savage, C.D., Winkler, P.: Monotone Gray codes and the middle levels problem. J. Combin. Theory Ser. A 70(2), 230\u2013248 (1995). https:\/\/doi.org\/10.1016\/0097-3165(95)90091-8","journal-title":"J. Combin. Theory Ser. A"},{"key":"2_CR23","unstructured":"Simmons, G.J.: Almost all $$n$$-dimensional rectangular lattices are Hamilton-laceable. Congr. Numer. XXI, 649\u2013661 (1978). Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1978)"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Vandenbussche, J., West, D.B.: Extensions to 2-factors in bipartite graphs. Electron. J. Combin. 20(3), Paper 11, 10 p (2013). https:\/\/doi.org\/10.37236\/3594","DOI":"10.37236\/3594"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:05:34Z","timestamp":1718975134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}