Abstract
The closure $$\mathrm{cl}(G)$$cl(G) of a claw-free graph $$G$$G is the graph obtained from $$G$$G by a series of local completions at eligible vertices, as long as this is possible. The construction of an SM-closure of $$G$$G follows the same operations, but if $$G$$G is not Hamilton-connected, then the construction terminates once every local completion at an eligible vertex leads to a Hamilton-connected graph. Although [see e.g. Ryjaă?ek and Vrana (J Graph Theory 66:137---151, 2011)] $$\mathrm{cl}(G)$$cl(G) may be Hamilton-connected even if $$G$$G is not, we show that if $$G$$G is a 2-connected claw-free graph with minimum degree at least 3 such that its SM-closure is hourglass-free, then $$G$$G is Hamilton-connected if and only if the closure $$\mathrm{cl}(G)$$cl(G) of $$G$$G is Hamilton-connected.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.