{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:40:12Z","timestamp":1775054412778,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,4,12]],"date-time":"2012-04-12T00:00:00Z","timestamp":1334188800000},"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":[[2013,7]]},"DOI":"10.1007\/s00373-012-1168-9","type":"journal-article","created":{"date-parts":[[2012,4,11]],"date-time":"2012-04-11T04:40:08Z","timestamp":1334119208000},"page":"1051-1057","source":"Crossref","is-referenced-by-count":14,"title":["Sufficient Condition for the Existence of an Even [a, b]-Factor in Graph"],"prefix":"10.1007","volume":"29","author":[{"given":"Mekkia","family":"Kouider","sequence":"first","affiliation":[]},{"given":"Saliha","family":"Ouatiki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,12]]},"reference":[{"key":"1168_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, a survey. J. Graph Theory 9, 1\u201342 (1985)","journal-title":"J. Graph Theory"},{"issue":"6","key":"1168_CR2","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.aml.2008.11.002","volume":"22","author":"J. Cai","year":"2009","unstructured":"Cai J., Liu G., Hou J.: The stability number and connected [k, k\u00a0+\u00a01]-factor in graphs. Appl. Math. Lett. 22(6), 927\u2013931 (2009)","journal-title":"Appl. Math. Lett."},{"key":"1168_CR3","unstructured":"Kano M.: An Ore-type sufficient condition for a graph to have a connected [2, k]-factor, (preprint)"},{"key":"1168_CR4","first-page":"81","volume":"57","author":"P. Katerinis","year":"2000","unstructured":"Katerinis P., Tsikopoulos N.: Independence number, connectivity and f-factors. Utilitas Math 57, 81\u201395 (2000)","journal-title":"Utilitas Math"},{"issue":"4","key":"1168_CR5","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"},{"issue":"2","key":"1168_CR6","first-page":"151","volume":"7","author":"M. Kouider","year":"2010","unstructured":"Kouider M., Ouatiki S.: Stability number and even [2,b]-factors in graphs. AKCE J. Graphs Combin. 7(2), 151\u2013169 (2010)","journal-title":"AKCE J. Graphs Combin."},{"key":"1168_CR7","first-page":"139","volume":"27","author":"M. Kouider","year":"2003","unstructured":"Kouider M., Vestergaard P.D.: On even [2, b]-factors in graphs. Aust. J. Combin. 27, 139\u2013147 (2003)","journal-title":"Aust. J. Combin."},{"key":"1168_CR8","doi-asserted-by":"crossref","first-page":"431","DOI":"10.7151\/dmgt.1242","volume":"24","author":"M. Kouider","year":"2004","unstructured":"Kouider M., Vestergaard P.D.: Even [a, b]-factors in graphs. Disc. Math. Graph Theory 24, 431\u2013441 (2004)","journal-title":"Disc. Math. Graph Theory"},{"key":"1168_CR9","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":"1168_CR10","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":"1168_CR11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01375473","volume":"11","author":"V. Neumann-Lara","year":"1991","unstructured":"Neumann-Lara V., Rivera-Campo E.: Spanning trees with bounded degrees. Combinatorica 11(1), 55\u201361 (1991)","journal-title":"Combinatorica"},{"issue":"1","key":"1168_CR12","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":"1168_CR13","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. Discret. Math. 307(7\u20138), 791\u2013821 (2007)","journal-title":"Discret. Math."},{"key":"1168_CR14","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"},{"issue":"12","key":"1168_CR15","doi-asserted-by":"crossref","first-page":"4144","DOI":"10.1016\/j.disc.2008.12.013","volume":"309","author":"S. Zhou","year":"2009","unstructured":"Zhou S.: Indepenpdence number connectivity and (a, b, k)-critical graphs. Discret. Math. 309(12), 4144\u20134148 (2009)","journal-title":"Discret. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1168-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1168-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1168-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:33Z","timestamp":1559055573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1168-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,12]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1168"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1168-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,12]]}}}