Packing spanning trees in highly essentially connected graphs

(v) For a line graph G=L(H), if G is (⌈g2g−k⌉−2)-connected and δ(H)≥g, then G is spanning k-connected.