{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:25Z","timestamp":1759638925584},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1977,1,1]],"date-time":"1977-01-01T00:00:00Z","timestamp":220924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":13346,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1977]]},"DOI":"10.1016\/0012-365x(77)90079-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:33:13Z","timestamp":1027639993000},"page":"213-216","source":"Crossref","is-referenced-by-count":7,"title":["A note on 1-factors in certain regular multigraphs"],"prefix":"10.1016","volume":"18","author":[{"given":"Allan B.","family":"Cruse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(77)90079-6_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(77)90079-6_BIB2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0012-365X(75)90012-6","article-title":"A note on symmetric doubly-stochastic matrices","volume":"13","author":"Cruse","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(77)90079-6_BIB3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","article-title":"Some theorems on abstract graphs","volume":"2","author":"Dirac","year":"1952","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/0012-365X(77)90079-6_BIB4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0, 1-vertices","volume":"69B","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0012-365X(77)90079-6_BIB5","series-title":"Studies in Pure Mathematics","article-title":"Edge-disjoint hamiltonian circuits in graphs with vertices of large valencies","author":"J.A. Nash-Williams","year":"1971"},{"key":"10.1016\/0012-365X(77)90079-6_BIB6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","article-title":"Die Theorie der regularen Graphen","volume":"4","author":"Petersen","year":"1891","journal-title":"Acta Math."},{"key":"10.1016\/0012-365X(77)90079-6_BIB7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","article-title":"The factorization of linear graphs","volume":"22","author":"Tutte","year":"1947","journal-title":"J. London Math. Soc."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X77900796?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X77900796?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:57:35Z","timestamp":1555138655000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X77900796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1977]]}},"alternative-id":["0012365X77900796"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(77)90079-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1977]]}}}