Abstract
Abstract A graph G is said to be claw-free if G has no induced subgraph isomorphic to K 1 , 3 . We study about the minimum length of cycles in 2-factors of claw-free graphs, and we show that every claw-free graph G with minimum degree δ ⩾ 4 has a 2-factor in which each cycle contains at least ⌈ δ − 1 2 ⌉ vertices and every 2-connected claw-free graph G with δ ⩾ 3 has a 2-factor in which each cycle contains at least δ vertices.
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.
