An improvement of sufficient condition for $k$-leaf-connected graphs

Tingyan Ma, Guoyan Ao, Ruifang Liu +2

For integer $k\ge 2,$ a graph $G$ is called $k$-leaf-connected if $|V(G)|\ge k+1$ and given any subset $S\subseteq V(G)$ with $|S|=k,$ $G$ always has a spanning tree $T$ such that…