{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T04:08:51Z","timestamp":1780373331426,"version":"3.54.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":6286,"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":[[1996,5]]},"DOI":"10.1016\/0012-365x(94)00085-w","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"87-90","source":"Crossref","is-referenced-by-count":16,"title":["Sufficient conditions for graphs to have (g, f)-factors"],"prefix":"10.1016","volume":"151","author":[{"given":"Yoshimi","family":"Egawa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikio","family":"Kano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00085-W_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190090103","article-title":"Factors and factorizations of graphs \u2014 a survey","volume":"9","author":"Akiyama","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(94)00085-W_BIB2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1112\/blms\/23.2.121","article-title":"Factors of locally almost regular graphs","volume":"23","author":"Joentgen","year":"1991","journal-title":"Bull. London Math. Soc."},{"key":"10.1016\/0012-365X(94)00085-W_BIB3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0012-365X(83)90077-8","article-title":"[a, b]-factors of graphs","volume":"47","author":"Kano","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00085-W_BIB4","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/S0021-9800(70)80033-3","article-title":"Subgraphs with prescribed valencies","volume":"8","author":"Lov\u00e1sz","year":"1970","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(94)00085-W_BIB5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0167-5060(08)70514-4","article-title":"The subgraph problem","volume":"3","author":"Tutte","year":"1978","journal-title":"Ann. Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400085W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400085W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:00:06Z","timestamp":1556665206000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400085W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0012365X9400085W"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00085-w","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}