Sufficient conditions of $k$-leaf-connected graphs and spanning trees with bounded total $k$-excess

Guoyan Ao, Ruifang Liu, Jinjiang Yuan

Chvátal and Erdös [Discrete Math. 2 (1972) 111-113] stated that, for an $m$-connected graph $G$, if its independence number $\alpha (G)\le m-1$, then $G$ is Hamilton-connected. Note tha…