{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T14:20:37Z","timestamp":1775830837540,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Plantholt and Tipnis (1991) proved that for any even integer $r$, a regular multigraph $G$ with even order $n$, multiplicity $\\mu(G) \\leq r$ and degree high relative to $n$ and $r$ is 1-factorable. Here we extend this result to include the case when $r$ is any odd integer.  H\u00e4ggkvist and Perkovi\u0107 and Reed (1997) proved that the One-factorization Conjecture for simple graphs is asymptotically true. Our techniques yield an extension of this asymptotic result on simple graphs to a corresponding asymptotic result on multigraphs.<\/jats:p>","DOI":"10.37236\/1585","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T21:06:39Z","timestamp":1578690399000},"source":"Crossref","is-referenced-by-count":8,"title":["All Regular Multigraphs of Even Order and High Degree Are 1-factorable"],"prefix":"10.37236","volume":"8","author":[{"given":"Michael J.","family":"Plantholt","sequence":"first","affiliation":[]},{"given":"Shailesh K.","family":"Tipnis","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2001,12,8]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v8i1r41\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v8i1r41\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T00:16:22Z","timestamp":1579306582000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v8i1r41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12,8]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2001,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1585","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,12,8]]},"article-number":"R41"}}