{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T04:54:10Z","timestamp":1776401650998,"version":"3.51.2"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"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":11520,"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":[[1982]]},"DOI":"10.1016\/0012-365x(82)90048-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:31:50Z","timestamp":1027654310000},"page":"1-6","source":"Crossref","is-referenced-by-count":61,"title":["On factors with given components"],"prefix":"10.1016","volume":"42","author":[{"given":"Atsushi","family":"Amahashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikio","family":"Kano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0012-365X(82)90048-6_BIB1","first-page":"97","article-title":"on a {1, 2}-factor","volume":"16","author":"Akiyama","year":"1980","journal-title":"TRU Math."},{"key":"10.1016\/0012-365X(82)90048-6_BIB2","series-title":"Advances in Graph Theory,","first-page":"11","article-title":"Regularisable graphs","volume":"3","author":"Berge","year":"1978"},{"key":"10.1016\/0012-365X(82)90048-6_BIB3","series-title":"Graph Theory and Algorithms","article-title":"Some common properties for regularizable graphs, edge-critical graphs and B-graphs","volume":"108","author":"Berge","year":"1981"},{"key":"10.1016\/0012-365X(82)90048-6_BIB4","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0012-365X(82)90048-6_BIB5","doi-asserted-by":"crossref","first-page":"720","DOI":"10.4153\/CJM-1965-072-1","article-title":"A theorem on k-saturated graphs","volume":"17","author":"Hajnal","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(82)90048-6_BIB6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","article-title":"The fractorization of linear graphs","volume":"22","author":"Tutte","year":"1947","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(82)90048-6_BIB7","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","article-title":"The factor of graphs","volume":"4","author":"Tutte","year":"1952","journal-title":"Canad. J. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X82900486?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X82900486?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:26:32Z","timestamp":1555154792000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X82900486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982]]}},"alternative-id":["0012365X82900486"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(82)90048-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1982]]}}}