Abstract
A graph is said to be claw-free if it does not contain an induced subgraph isomorphic to K1,3. Let K4− be the graph obtained by removing exactly one edge from K4 and let k be an integer with k ⩾ 2. We prove that if G is a claw-free graph of order at least 13k − 12 and with minimum degree at least five, then G contains k vertex-disjoint copies of K4−. The requirement of number five is necessary.
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.
