Abstract

AbstractThe generalized bull is the graph obtained by attaching endvertices of two disjoint paths of lengths to two vertices of a triangle. We prove that every 3‐connected ‐free graph, where , is Hamilton‐connected. The results are sharp and complete the characterization of forbidden induced bulls implying Hamilton‐connectedness of a 3‐connected {claw, bull}‐free graph.

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 call

Disclaimer: 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.