Abstract
A graph is said to be claw-free if it does not contain an induced subgraph isomorphic to K1,3. Let G=(V,E) be a claw-free graph of order n and let W be a subset of V with |W|≥3k, where k is a positive integer. In this paper, we show that if the degree of each vertex of W is at least (n+1)/2, then G contains k disjoint cycles such that each of them contains at least three vertices of W. The degree condition is sharp in a sense. This generalizes Wang's result (2015) [13] in claw-free graphs and the theorem of Faudree et al. (2012) [9] when n is odd.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
