{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T07:53:50Z","timestamp":1726300430259},"reference-count":7,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6427,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1989,3]]},"abstract":"Abstract<\/jats:title>We show that if r<\/jats:italic> \u2a7e 1 is an odd integer and G<\/jats:italic> is a graph with |V(G)<\/jats:italic>| even such that k<\/jats:italic>(G<\/jats:italic>) \u2a7e (r<\/jats:italic> + 1)2<\/jats:sup>\/2 and (r<\/jats:italic> + 1)2<\/jats:sup>\u03b1(G<\/jats:italic>) \u2a7d 4rk<\/jats:italic>(G<\/jats:italic>), then G<\/jats:italic> has an r<\/jats:italic>\u2010factor; if r<\/jats:italic> \u2a7e 2 is even and G<\/jats:italic> is a graph with k<\/jats:italic>(G<\/jats:italic>) \u2a7e r<\/jats:italic>(r<\/jats:italic> + 2)\/2 and (r<\/jats:italic> + 2)\u03b1(G<\/jats:italic>) \u2a7d 4k<\/jats:italic>(G<\/jats:italic>), then G<\/jats:italic> has an r<\/jats:italic>\u2010factor (where k<\/jats:italic>(G<\/jats:italic>) and \u03b1(G<\/jats:italic>) denote the connectivity and the independence number of G<\/jats:italic>, respectively).<\/jats:p>","DOI":"10.1002\/jgt.3190130109","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T12:18:25Z","timestamp":1180181905000},"page":"63-69","source":"Crossref","is-referenced-by-count":16,"title":["Independence number, connectivity, and r\u2010factors"],"prefix":"10.1002","volume":"13","author":[{"given":"Tsuyoshi","family":"Nishimura","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090107"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(72)90079-9"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090106"},{"key":"e_1_2_1_6_2","first-page":"185","article-title":"A Chv\u00e1tal\u2010Erd\u00f6s condition for an r\u2010factor in a graph","volume":"20","author":"Katerinis P.","year":"1985","journal-title":"Ars Combinat."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1952-028-2"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1954-033-3"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190130109","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T16:52:37Z","timestamp":1697907157000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["10.1002\/jgt.3190130109"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130109","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}