{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T15:48:26Z","timestamp":1757778506788,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A graph is $d$-bounded if its maximum degree is at most $d$.\u00a0 We apply the Ore-Ryser Theorem on $f$-factors in bipartite graphs to obtain conditions for the extension of a $2$-bounded subgraph to a $2$-factor in a bipartite graph.\u00a0 As consequences, we prove that every matching in the $5$-dimensional hypercube extends to a $2$-factor, and we obtain conditions for this property in general regular bipartite graphs.\u00a0 For example, to show that every matching in a regular $n$-vertex bipartite graph extends to a $2$-factor, it suffices to show that all matchings with fewer than $n\/3$ edges extend to $2$-factors.<\/jats:p>","DOI":"10.37236\/3594","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T06:32:46Z","timestamp":1578724366000},"source":"Crossref","is-referenced-by-count":5,"title":["Extensions to 2-Factors in Bipartite Graphs"],"prefix":"10.37236","volume":"20","author":[{"given":"Jennifer","family":"Vandenbussche","sequence":"first","affiliation":[]},{"given":"Douglas B.","family":"West","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2013,8,2]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i3p11\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i3p11\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T11:16:22Z","timestamp":1579259782000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v20i3p11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,2]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2013,7,19]]}},"URL":"https:\/\/doi.org\/10.37236\/3594","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2013,8,2]]},"article-number":"P11"}}