English K-vertex-connected graph Cited by user David Eppstein on 02 Apr 2024 In graph theory, a connected graph G is said to be k-vertex-connected (or k-connected) if it has more than k vertices and remains connected whenever fewer than k…