A generalization of the Chv\'{a}tal-Erd\H{o}s theorem

A well-known result of Chv\'{a}tal and Erd\H{o}s from 1972 states that a graph with connectivity not less than its independence number plus one is hamiltonian-connected. A graph $G$ is called an $[s,t]$-graph if any induced subgraph of $G$ of order $s$ has size at least $t.$ We prove that every $k$-connected $[k+1,2]$-graph is hamiltonian-connected except $kK_1\vee G_{k},$ where $k\ge 2$ and $G_{k}$ is an arbitrary graph of order $k.$ This generalizes the Chv\'{a}tal-Erd\H{o}s theorem.