{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T05:43:05Z","timestamp":1671774185850},"reference-count":5,"publisher":"Cambridge University Press (CUP)","issue":"1-2","license":[{"start":{"date-parts":[[2012,2,2]],"date-time":"2012-02-02T00:00:00Z","timestamp":1328140800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2012,3]]},"abstract":"<jats:p>A graph is claw-free if it does not contain an induced subgraph isomorphic to <jats:italic>K<\/jats:italic><jats:sub>1,3<\/jats:sub>. Cycles in claw-free graphs have been well studied. In this paper we extend results on disjoint cycles in claw-free graphs satisfying certain minimum degree conditions. In particular, we prove that if <jats:italic>G<\/jats:italic> is claw-free of sufficiently large order <jats:italic>n<\/jats:italic> = 3<jats:italic>k<\/jats:italic> with \u03b4(<jats:italic>G<\/jats:italic>) \u2265 <jats:italic>n<\/jats:italic>\/2, then <jats:italic>G<\/jats:italic> contains <jats:italic>k<\/jats:italic> disjoint triangles.<\/jats:p>","DOI":"10.1017\/s0963548311000708","type":"journal-article","created":{"date-parts":[[2012,3,19]],"date-time":"2012-03-19T15:20:59Z","timestamp":1332170459000},"page":"129-139","source":"Crossref","is-referenced-by-count":3,"title":["Minimum Degree and Disjoint Cycles in Claw-Free Graphs"],"prefix":"10.1017","volume":"21","author":[{"given":"RALPH J.","family":"FAUDREE","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"RONALD J.","family":"GOULD","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MICHAEL S.","family":"JACOBSON","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2012,2,2]]},"reference":[{"key":"S0963548311000708_ref2","first-page":"157","article-title":"Vertex disjoint cycles for star-free graphs","volume":"11","author":"Chen","year":"1995","journal-title":"Australas. J. Combin."},{"key":"S0963548311000708_ref1","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1116"},{"key":"S0963548311000708_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01895727"},{"key":"S0963548311000708_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s003730170060"},{"key":"S0963548311000708_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009833"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548311000708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T01:25:44Z","timestamp":1556241944000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548311000708\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,2]]},"references-count":5,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["S0963548311000708"],"URL":"https:\/\/doi.org\/10.1017\/s0963548311000708","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,2]]}}}