Abstract:
We show, that if graph on $n$ vertices is mimimally and contraction critically $k$-connected, then it has at least $n/2$ vertices of degree $k$ for $k=7,8$. Bibl. 17 titles.
Key words and phrases:$k$-connectivity, minimally $k$-connected, contraction critically $k$-connected.