{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T10:43:52Z","timestamp":1747046632918},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1007\/bf01787576","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T11:26:38Z","timestamp":1119180398000},"page":"245-251","source":"Crossref","is-referenced-by-count":11,"title":["A sufficient condition for a graph to have [a, b]-factors"],"prefix":"10.1007","volume":"6","author":[{"given":"Mikio","family":"Kano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01787576_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190090103","volume":"9","author":"J. Akiyama","year":"1985","unstructured":"Akiyama, J., Kano, M.: Factors and factorizations of graphs \u2014 A survey. J. Graph Theory9, 1\u201342 (1985)","journal-title":"J. Graph Theory"},{"key":"BF01787576_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(82)90048-6","volume":"42","author":"A. Amahashi","year":"1982","unstructured":"Amahashi, A., Kano, M.: Factors with given components. Ann. Discrete Math.42, 1\u20136 (1982)","journal-title":"Ann. Discrete Math."},{"key":"BF01787576_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0095-8956(71)90041-4","volume":"10","author":"I. Anderson","year":"1971","unstructured":"Anderson, I.: Perfect matchings of a graph. J. Combin. Theory (B)10, 183\u2013186 (1971)","journal-title":"J. Combin. Theory (B)"},{"key":"BF01787576_CR4","volume-title":"Graphs and digraphs","author":"F. Behzad","year":"1979","unstructured":"Behzad, F., Chartrand, G. and Lesniak-Foster, L.: Graphs and digraphs. Boston: Prindle, Qeber and Schmidt, 1979"},{"key":"BF01787576_CR5","first-page":"165","volume":"81","author":"C. Berge","year":"1978","unstructured":"Berge, C., Las Vergnas, M.: On the existence of subgraphs with degree constraints. Proc. K. Ned. Acad. Wet. Amsterdam, (A)81, 165\u2013176 (1978).","journal-title":"Proc. K. Ned. Acad. Wet. Amsterdam, (A)"},{"key":"BF01787576_CR6","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1002\/jgt.3190120305","volume":"12","author":"Y. Cui","year":"1988","unstructured":"Cui, Y., Kano, M.: Some results on odd factors of graphs. J. Graph Theory,12, 327\u2013333 (1988)","journal-title":"J. Graph Theory"},{"key":"BF01787576_CR7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/jgt.3190120115","volume":"12","author":"H. Enomoto","year":"1988","unstructured":"Enomoto, H., Ota, K. and Kano, M.: A sufficient condition for a bipartite graph to have ak-factor. J. Graph Theory,12, 141\u2013151 (1988)","journal-title":"J. Graph Theory"},{"key":"BF01787576_CR8","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/S0021-9800(70)80033-3","volume":"9","author":"L. Lov\u00e1sz","year":"1970","unstructured":"Lov\u00e1sz, L.: Subgraphs with prescribed valencies. J. Comb. Theory9, 391\u2013416 (1970)","journal-title":"J. Comb. Theory"},{"key":"BF01787576_CR9","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/BF02579180","volume":"1","author":"W.T. Tutte","year":"1981","unstructured":"Tutte, W.T.: Graph factors. Combinatorica,1, 70\u201397 (1981)","journal-title":"Combinatorica"},{"key":"BF01787576_CR10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0095-8956(73)90038-5","volume":"15","author":"D.R. Woodall","year":"1973","unstructured":"Woodall, D.R.: The binding number of a graph and its Anderson number. J. Comb. Theory (B) 15, 225\u2013255 (1973)","journal-title":"J. Comb. Theory (B)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01787576.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01787576\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01787576","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T13:12:18Z","timestamp":1557493938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01787576"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["BF01787576"],"URL":"https:\/\/doi.org\/10.1007\/bf01787576","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}