Hamiltonicity of $1$-tough $(P_2\cup k{P}_1)$-free graphs

Leyou Xu, Chengli Li, Bo Zhou

Given a graph $H$, a graph $G$ is $H$-free if $G$ does not contain $H$ as an induced subgraph. For a positive real number $t$, a non-complete graph $G$ is said to be $t$-tough if f…