{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T13:56:25Z","timestamp":1778680585412,"version":"3.51.4"},"reference-count":10,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":5575,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1991,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We show that every connected <jats:italic>K<\/jats:italic><jats:sub>1,3<\/jats:sub>\u2010free graph with minimum degree at least <jats:italic>2k<\/jats:italic> contains a <jats:italic>k<\/jats:italic>\u2010factor and construct connected <jats:italic>K<\/jats:italic><jats:sub>1,3<\/jats:sub>\u2010free graphs with minimum degree <jats:italic>k<\/jats:italic> + <jats:italic>0<\/jats:italic>(\u221a<jats:italic>k<\/jats:italic>) that have no <jats:italic>k<\/jats:italic>\u2010factor.<\/jats:p>","DOI":"10.1002\/jgt.3190150304","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T07:17:21Z","timestamp":1181287041000},"page":"259-265","source":"Crossref","is-referenced-by-count":24,"title":["Regular factors in <i>K<\/i><sub>1,3<\/sub>\u2010free graphs"],"prefix":"10.1002","volume":"15","author":[{"given":"S. A.","family":"Choudum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. S.","family":"Paulraj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"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\/1385-7258(73)90007-3"},{"key":"e_1_2_1_5_2","first-page":"96","volume-title":"Recent Studies in Graph Theory","author":"Egawa Y.","year":"1989"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090106"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02880991"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130109"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.2307\/2039666"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1952-028-2"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579180"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190150304","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190150304","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T21:47:17Z","timestamp":1698011237000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190150304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["10.1002\/jgt.3190150304"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190150304","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}