Abstract
In the present paper we show that if G is a 2-connected claw-free graph such that the vertices of degree 1 of every induced bull have a common neighbour in G then G is hamiltonian. This statement was originally conjectured by H.J. Broersma and H.J. Veldman
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.
