Minimum Number of Edges To Add to Make a Graph 2-Vertex-Connected 
Difference between en1 and en2, changed 16 character(s)
Given a connected, undirn undirected connected graph, what is the minimum number of edges that must be added to it to make it 2-vertex-connected, and what are those edges?↵
↵
Is the methodology for this problem similar to the same situation of making a graph 2-edge-connected (adding ceil(numPendants/2) edges)?↵
↵
Please help, and thanks in advance!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English vamaddur 2017-10-21 16:26:59 16 Tiny change: 'Given a connected, undirected grap' -> 'Given an undirected connected grap'
en1 English vamaddur 2017-10-17 03:21:51 399 Initial revision (published)