{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T04:55:00Z","timestamp":1776401700683,"version":"3.51.2"},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":8264,"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":[[1990,12]]},"DOI":"10.1016\/0012-365x(90)90387-w","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"313-317","source":"Crossref","is-referenced-by-count":39,"title":["A simple existence criterion for (g &lt; f)- factors"],"prefix":"10.1016","volume":"85","author":[{"given":"Katherine","family":"Heinrich","sequence":"first","affiliation":[]},{"given":"Pavol","family":"Hell","sequence":"additional","affiliation":[]},{"given":"David G.","family":"Kirkpatrick","sequence":"additional","affiliation":[]},{"given":"Guizhen","family":"Liu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90387-W_BIB1","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/0196-6774(85)90022-7","article-title":"An algorithmic proof of Tutte's \u0192-factor theorem","volume":"6","author":"Anstee","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(90)90387-W_BIB2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0166-218X(90)90126-W","article-title":"Simplified existence theorems for (g,\u0192)-factors","volume":"27","author":"Anstee","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(90)90387-W_BIB3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S1385-7258(78)80007-9","article-title":"On the existence of subgraphs with degree constraints","volume":"A81","author":"Berge","year":"1978","journal-title":"Proc. Nederl. Akad. Wettensch."},{"key":"10.1016\/0012-365X(90)90387-W_BIB4","first-page":"448","article-title":"An efficient reduction technique for degree constrained subgraphs and bidirected network flow problems","author":"Gabow","year":"1983","journal-title":"15th ACM STOC"},{"key":"10.1016\/0012-365X(90)90387-W_BIB5","unstructured":"K. Heinrich, P. Hell, D.G. Kirkpatrick, and G. Liu, A simple existence criterion for (g < \u0192)-factors, with applications to [a,b]-factors, SFU Math. Research Report 86-16."},{"key":"10.1016\/0012-365X(90)90387-W_BIB6","unstructured":"P. Hell and D.G. Kirkpatrick, Factors and flows, UBC Computer Science Tech. Report 86-22."},{"key":"10.1016\/0012-365X(90)90387-W_BIB7","doi-asserted-by":"crossref","unstructured":"P. Hell and D.G. Kirkpatrick, Algorithms for degree constrained graph factors of minimum deficiency, submitted to J. Algorithms.","DOI":"10.1006\/jagm.1993.1006"},{"key":"10.1016\/0012-365X(90)90387-W_BIB8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n52 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0012-365X(90)90387-W_BIB9","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(90)90387-W_BIB10","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0012-365X(78)90006-7","article-title":"An extension of Tutte's 1-factor theorem","volume":"23","author":"Las Vergnas","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90387-W_BIB11","doi-asserted-by":"crossref","first-page":"319","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(90)90387-W_BIB12","article-title":"Matching Theory","volume":"29","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/0012-365X(90)90387-W_BIB13","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1002\/jgt.3190050415","article-title":"A remark on the factor theorems of Lov\u00e1sz and Tutte","volume":"5","author":"Thomassen","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90387-W_BIB14","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."},{"key":"10.1016\/0012-365X(90)90387-W_BIB15","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."},{"key":"10.1016\/0012-365X(90)90387-W_BIB16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02579180","article-title":"Graph factors","volume":"1","author":"Tutte","year":"1981","journal-title":"Combinatorica"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090387W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090387W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:55:53Z","timestamp":1555134953000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090387W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["0012365X9090387W"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90387-w","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}