{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T12:42:52Z","timestamp":1774528972037,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"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":7808,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0095-8956(92)90053-z","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:00:02Z","timestamp":1107957602000},"page":"213-221","source":"Crossref","is-referenced-by-count":20,"title":["Binding numbers and f-factors of graphs"],"prefix":"10.1016","volume":"54","author":[{"given":"Mikio","family":"Kano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norihide","family":"Tokushige","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(92)90053-Z_BIB1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0095-8956(71)90041-4","article-title":"Perfect matchings of a graph","volume":"10","author":"Anderson","year":"1971","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(92)90053-Z_BIB2","first-page":"129","article-title":"Sufficient conditions for matchings","volume":"18","author":"Anderson","year":"1972"},{"key":"10.1016\/0095-8956(92)90053-Z_BIB3","series-title":"Recent Studies in Graph Theory","first-page":"96","article-title":"Sufficient conditions for the existence of k-factors","author":"Egawa","year":"1989"},{"key":"10.1016\/0095-8956(92)90053-Z_BIB4","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/jgt.3190120115","article-title":"A sufficient condition for a biparitite graph to have a k-factor","volume":"12","author":"Enomoto","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/0095-8956(92)90053-Z_BIB5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF01787576","article-title":"Sufficient conditions for a graph to have [a, b]-factors","volume":"6","author":"Kano","year":"1990","journal-title":"Graphs Combin"},{"key":"10.1016\/0095-8956(92)90053-Z_BIB6","first-page":"123","article-title":"Minimum degree of a graph and the existence of k-factors","volume":"94","author":"Katerinis","year":"1985"},{"key":"10.1016\/0095-8956(92)90053-Z_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190110102","article-title":"Two sufficient conditions for a 2-factor in a bipartite graph","volume":"11","author":"Katerinis","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/0095-8956(92)90053-Z_BIB8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1093\/qmath\/38.2.221","article-title":"Binding numbers of graphs and the existence of k-factors","volume":"38","author":"Katerinis","year":"1987","journal-title":"Quart. J. Math."},{"key":"10.1016\/0095-8956(92)90053-Z_BIB9","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1002\/jgt.3190130511","article-title":"Binding number and minimum degree for k-factors","volume":"13","author":"Tokushige","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/0095-8956(92)90053-Z_BIB10","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","article-title":"The factors of graphs","volume":"4","author":"Tutte","year":"1952","journal-title":"Canad. J. Math."},{"key":"10.1016\/0095-8956(92)90053-Z_BIB11","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","article-title":"A short proof of the factor theorem for finite graphs","volume":"6","author":"Tutte","year":"1954","journal-title":"Cand. J. Math."},{"key":"10.1016\/0095-8956(92)90053-Z_BIB12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0095-8956(73)90038-5","article-title":"The binding number of a graph and its Anderson number","volume":"15","author":"Woodall","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(92)90053-Z_BIB13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1112\/jlms\/s2-41.3.385","article-title":"k-Factors and neighbourhoods of independent sets in graphs","volume":"41","author":"Woodall","year":"1990","journal-title":"J. London Math. Soc. (2)"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569290053Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569290053Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T18:28:52Z","timestamp":1548786532000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009589569290053Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["009589569290053Z"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(92)90053-z","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}