Back
Add Comment
Topics
Vote
Results
k-edge-connected graph
graph that remains connected whenever fewer than k edges are removed
--Agreed Upon Solutions

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

anonymous