Sufficient conditions for $(K_2\cup k{K}_1)$-free graphs to be Hamilton-connected

Xiaoqiong Xu, Shujie Chen, Fengming Dong +1

The toughness of a non-complete graph $G$, denoted $\tau (G)$, is defined as \[ τ(G) = \min\left\{ \frac{|S|}{ω(G-S)} : S \subseteq V(G),\ ω(G-S) \geq 2 \right\}, \] where $\omega (G-S)$ is…