{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:40:56Z","timestamp":1767314456159,"version":"3.48.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032118349","type":"print"},{"value":"9783032118356","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-11835-6_19","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:39:02Z","timestamp":1767314342000},"page":"258-269","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Matchings with\u00a0Five Directions in\u00a0Hypercubes Extend to\u00a0Hamilton Cycles and\u00a0Paths with\u00a0Prescribed Ends"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5065-1213","authenticated-orcid":false,"given":"Ji\u0159\u00ed","family":"Fink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-6167-6733","authenticated-orcid":false,"given":"Vojt\u011bch","family":"Hotmar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"issue":"1","key":"19_CR1","first-page":"241","volume":"17","author":"A Alahmadi","year":"2015","unstructured":"Alahmadi, A., Aldred, R.E., Alkenani, A., Hijazi, R., Sol\u00e9, P., Thomassen, C.: Extending a perfect matching to a Hamiltonian cycle. Discret. Math. Theor. Comput. Sci. (Online Edn.) 17(1), 241\u2013254 (2015)","journal-title":"Discret. Math. Theor. Comput. Sci. (Online Edn.)"},{"key":"19_CR2","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. Discret. Math. Theor. Comput. Sci. 11, 123\u2013147 (2009)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Dvo\u0159\u00e1k, T., Fink, J.: Gray codes extending quadratic matchings. J. Graph Theory (2018). https:\/\/doi.org\/10.1002\/jgt.22371","DOI":"10.1002\/jgt.22371"},{"issue":"16","key":"19_CR4","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. Discret. Math. 307(16), 1982\u20131998 (2007)","journal-title":"Discret. Math."},{"issue":"1","key":"19_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. Discret. Math. 19(1), 135\u2013144 (2005)","journal-title":"SIAM J. Discret. Math."},{"issue":"6","key":"19_CR6","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. Comb. Theory Ser. B 97(6), 1074\u20131076 (2007)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00493-017-3731-8","volume":"39","author":"J Fink","year":"2018","unstructured":"Fink, J.: Matchings extend into 2-factors in hypercubes. Combinatorica 39(1), 77\u201384 (2018). https:\/\/doi.org\/10.1007\/s00493-017-3731-8","journal-title":"Combinatorica"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-031-63021-7_2","volume-title":"Combinatorial Algorithms","author":"J Fink","year":"2024","unstructured":"Fink, J., M\u00fctze, T.: Matchings in hypercubes extend to long cycles. In: Rescigno, A.A., Vaccaro, U. (eds.) IWOCA 2024. LNCS, vol. 14764, pp. 14\u201327. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-63021-7_2"},{"issue":"6","key":"19_CR9","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. Discret. Math. 309(6), 1711\u20131713 (2009)","journal-title":"Discret. Math."},{"issue":"2","key":"19_CR10","first-page":"2","volume":"25","author":"P Gregor","year":"2018","unstructured":"Gregor, P., Novotn\u00fd, T., \u0160krekovski, R.: Extending perfect matchings to gray codes with prescribed ends. Electron. J. Comb. 25(2), 2\u201356 (2018)","journal-title":"Electron. J. Comb."},{"key":"19_CR11","volume-title":"Th\u00e9orie du Baguenodier","author":"L Gros","year":"1872","unstructured":"Gros, L.: Th\u00e9orie du Baguenodier. Aim\u00e9 Vingtrinier, Lyon (1872)"},{"key":"19_CR12","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations. Addison-Wesley Professional (2005)"},{"key":"19_CR13","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."},{"issue":"11","key":"19_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/s0898-1221(97)00223-x","volume":"34","author":"M Lewinter","year":"1997","unstructured":"Lewinter, M., Widulski, W.: Hyper-Hamilton laceable and caterpillar-spannable product graphs. Comput. Math. Appl. 34(11), 99\u2013104 (1997). https:\/\/doi.org\/10.1016\/s0898-1221(97)00223-x","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"19_CR15","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. Discret. Math. 6(1), 152\u2013166 (1993)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"19_CR16","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C Savage","year":"1997","unstructured":"Savage, C.: A survey of combinatorial Gray codes. SIAM Rev. 39(4), 605\u2013629 (1997)","journal-title":"SIAM Rev."},{"key":"19_CR17","unstructured":"Simmons, G.J.: Almost all n-dimensional rectangular lattices are Hamilton-laceable. In: Presented at the 9th Southeastern Conference on Combinatoric Graph Theory and Computing (1977)"},{"issue":"3","key":"19_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/3041","volume":"20","author":"J Vandenbussche","year":"2013","unstructured":"Vandenbussche, J., West, D.B.: Extensions to $$2 $$-factors in bipartite graphs. Electron. J. Comb. 20(3), 1\u201310 (2013)","journal-title":"Electron. J. Comb."},{"issue":"6","key":"19_CR19","doi-asserted-by":"publisher","first-page":"5237","DOI":"10.1051\/ro\/2024210","volume":"58","author":"S Wang","year":"2024","unstructured":"Wang, S., Wang, F.: A kind of matchings extend to Hamiltonian cycles in hypercubes. RAIRO-Oper. Res. 58(6), 5237\u20135254 (2024)","journal-title":"RAIRO-Oper. Res."},{"key":"19_CR20","unstructured":"Xu, J.: Topological Structure and Analysis of Interconnection Networks, vol.\u00a07. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11835-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:39:04Z","timestamp":1767314344000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11835-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032118349","9783032118356"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11835-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Otzenhausen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.uni-trier.de\/wg2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}