{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:49:28Z","timestamp":1767340168954},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,6,5]],"date-time":"2018-06-05T00:00:00Z","timestamp":1528156800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s00493-017-3731-8","type":"journal-article","created":{"date-parts":[[2018,6,6]],"date-time":"2018-06-06T06:53:50Z","timestamp":1528268030000},"page":"77-84","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Matchings Extend into 2-Factors in Hypercubes"],"prefix":"10.1007","volume":"39","author":[{"given":"Ji\u0159\u00ed","family":"Fink","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,5]]},"reference":[{"key":"3731_CR1","doi-asserted-by":"crossref","unstructured":"A. Alahmadi, R. E. L. Aldred, A. Alkenani, R. Hijazi, P. Sol\u00e9 and C. Thomassen: Extending a perfect matching to a hamiltonian cycle, Discrete Math-ematics & Theoretical Computer Science 17, 2015.","DOI":"10.46298\/dmtcs.2105"},{"key":"3731_CR2","first-page":"123","volume":"11","author":"D. Dimitrov","year":"2009","unstructured":"D. Dimitrov, T. Dvo\u0159\u00e1k, P. Gregor and R. \u0160krekovski: Gray codes avoiding matchings, Discrete Mathematics & Theoretical Computer Science 11 (2009), 123\u2013147.","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"key":"3731_CR3","first-page":"135","volume":"19","author":"T. Dvo\u0159\u00e1k","year":"2005","unstructured":"T. Dvo\u0159\u00e1k: Hamiltonian cycles with prescribed edges in hypercubes, SIAM J. Dis-cret. Math. 19 (2005), 135\u2013144.","journal-title":"SIAM^J.^Dis-cret. Math."},{"key":"3731_CR4","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1016\/j.jctb.2007.02.007","volume":"97","author":"J. Fink","year":"2007","unstructured":"J. Fink: Perfect matchings extend to Hamilton cycles in hypercubes, J. Comb. The-ory, Ser. B 97 (2007), 1074\u20131076.","journal-title":"J. Comb. The-ory, Ser. B"},{"key":"3731_CR5","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1016\/j.disc.2008.02.013","volume":"309","author":"P. Gregor","year":"2009","unstructured":"P. Gregor: Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes, Discrete Mathematics 309 (2009), 1711\u20131713.","journal-title":"Discrete Mathematics"},{"key":"3731_CR6","volume-title":"Th\u00e9orie du Baguenodier","author":"L. Gros","year":"1872","unstructured":"L. Gros: Th\u00e9orie du Baguenodier, Aim\u00e9 Vingtrinier, Lyon, 1872."},{"key":"3731_CR7","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D. K\u0151nig","year":"1916","unstructured":"D. K\u0151nig: \u00dcber graphen und ihre anwendung auf determinantentheorie und mengenlehre, Mathematische Annalen 77 (1916), 453\u2013465.","journal-title":"Mathematische Annalen"},{"key":"3731_CR8","volume-title":"The Art of Computer Programming, Volume 4, Fascicles 0-4","author":"D. E. Knuth","year":"2009","unstructured":"D. E. Knuth: The Art of Computer Programming, Volume 4, Fascicles 0-4, Addison-Wesley Professional, 2009."},{"key":"3731_CR9","first-page":"87","volume":"16","author":"G. Kreweras","year":"1996","unstructured":"G. Kreweras: Matchings and Hamiltonian cycles on hypercubes, Bull. Inst. Com-bin. Appl. 16 (1996), 87\u201391.","journal-title":"Bull. Inst. Com-bin. Appl."},{"key":"3731_CR10","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1137\/0406012","volume":"6","author":"F. Ruskey","year":"1993","unstructured":"F. Ruskey and C.D. Savage: Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn, SIAM Journal on Discrete Mathematics 6 (1993), 152\u2013166.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"3731_CR11","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C. Savage","year":"1997","unstructured":"C. Savage: A survey of combinatorial Gray codes, SIAM Review 39 (1997), 605\u2013629.","journal-title":"SIAM Review"},{"key":"3731_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/3594","volume":"20","author":"J. Vandenbussche","year":"2013","unstructured":"J. Vandenbussche and D. B. West: Extensions to 2-factors in bipartite graphs, The Electronic Journal of Combinatorics 20 (2013), 1\u201310.","journal-title":"The Electronic Journal of Combinatorics"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3731-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-017-3731-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3731-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T02:46:48Z","timestamp":1661395608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-017-3731-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,5]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["3731"],"URL":"https:\/\/doi.org\/10.1007\/s00493-017-3731-8","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,5]]},"assertion":[{"value":"26 November 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}