Abstract
Kuipers and Veldman conjectured that any 3-connected claw-free graph with order ν and minimum degree δ ⩾ ( ν + 6 ) 10 is Hamiltonian for ν sufficiently large. In this paper, we prove that if H is a 3-connected claw-free graph with sufficiently large order ν, and if δ ( H ) ⩾ ( ν + 5 ) 10 , then either H is Hamiltonian, or δ ( H ) = ( ν + 5 ) 10 and the Ryjáček's closure cl ( H ) of H is the line graph of a graph obtained from the Petersen graph P 10 by adding ( ν − 15 ) 10 pendant edges at each vertex of P 10 .
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.
