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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
