Back
Add Comment
Topics
Vote
Results
k-vertex-connected graph
graph that cannot be disconnected by the deletion of fewer than k vertices
--Agreed Upon Solutions

The discussion does not exist would you like to add the first comment?

anonymous