k-connected graph
= k-connected graph
{title2=$k$-connected graph}
A graph with more than $k$ vertices is $k$-connected when deleting fewer than $k$ vertices always leaves it connected, equivalently when its <vertex connectivity> is at least $k$.
= k-connected graph
{title2=$k$-connected graph}
A graph with more than $k$ vertices is $k$-connected when deleting fewer than $k$ vertices always leaves it connected, equivalently when its <vertex connectivity> is at least $k$.