Hamilton‐connected {claw, bull}‐free graphs
Zdeněk Ryjáček, Petr Vrána · Journal of Graph Theory · 2022
Abstract The 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.