{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T11:15:45Z","timestamp":1648725345642},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,1]],"date-time":"2012-11-01T00:00:00Z","timestamp":1351728000000},"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":[[2014,1]]},"DOI":"10.1007\/s00373-012-1250-3","type":"journal-article","created":{"date-parts":[[2012,10,31]],"date-time":"2012-10-31T11:37:22Z","timestamp":1351683442000},"page":"197-202","source":"Crossref","is-referenced-by-count":0,"title":["Stability Number and f-Factors in Graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Mekkia","family":"Kouider","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,1]]},"reference":[{"key":"1250_CR1","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Kano, M.: Factors and Factorizations. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-21919-1"},{"key":"1250_CR2","unstructured":"Berge, C.: Graphes et Hypergraphes. Dunod (1970)"},{"key":"1250_CR3","unstructured":"Cai, J., Liu, G.: Stability Number and f-factor in K 1,n -free graphs. Ars Combin. 80 (2008)"},{"key":"1250_CR4","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0012-365X(90)90297-U","volume":"80","author":"P. Katerinis","year":"1990","unstructured":"Katerinis P.: Toughness and the existence of factors. Discrete Maths. 80, 81\u201392 (1990)","journal-title":"Discrete Maths."},{"key":"1250_CR5","first-page":"33","volume":"29","author":"P. Katerinis","year":"2000","unstructured":"Katerinis P., Tsikopoulos N.: Minimum degree and f-factors in graphs. N.Z. J. Math. 29, 33\u201340 (2000)","journal-title":"N.Z. J. Math."},{"issue":"4","key":"1250_CR6","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1002\/jgt.20008","volume":"46","author":"M. Kouider","year":"2004","unstructured":"Kouider M., Lonc Z.: Stability number and [a,b]-factors in graphs. J. Graph Theory 46(4), 254\u2013264 (2004)","journal-title":"J. Graph Theory"},{"key":"1250_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-004-0587-7","volume":"21","author":"M. Kouider","year":"2005","unstructured":"Kouider M., Vestergaard P.D.: Connected factors in graphs: a survey. Graphs Combin. 21, 1\u201326 (2005)","journal-title":"Graphs Combin."},{"key":"1250_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. Combin. Theory 9, 391\u2013416 (1970)","journal-title":"J. Combin. Theory"},{"issue":"1","key":"1250_CR9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/jgt.3190130109","volume":"13","author":"T. Nishimura","year":"1989","unstructured":"Nishimura T.: Independence number, connectivity, and r-factors. J. Graph Theory 13(1), 63\u201369 (1989)","journal-title":"J. Graph Theory"},{"issue":"7\u20138","key":"1250_CR10","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/j.disc.2005.11.059","volume":"307","author":"M.D. Plummer","year":"2007","unstructured":"Plummer M.D.: Graph factors and factorization: a survey. Discrete Math. 307(7\u20138), 791\u2013821 (2007)","journal-title":"Discrete Math."},{"key":"1250_CR11","doi-asserted-by":"crossref","unstructured":"Tutte, W.T.: Graph factors. Combinatorica 1, 70\u201397 (1981)","DOI":"10.1007\/BF02579180"},{"key":"1250_CR12","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice-Hall (1996)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1250-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1250-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1250-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:34Z","timestamp":1559055574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1250-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["1250"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1250-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,1]]}}}