title: Vertex Biconnected and Edge Biconnected misconception
body: <p>A connected graph is vertex biconnected if there is no vertex whose removal disconnects the graph. A connected graph is edge biconnected if there is no edge whose removal disconnects the graph.
  Give a proof or counterexample for each for the following statements:</p>
  
  <p>(a) A vertex biconnected graph is edge biconnected. </p>
  
  <p>(b) An edge biconnected graph is vertex biconnected.</p>
  
  <p>For A)My attempt is that it should be the case, since I don't see how removing a vertex will affect the biconnection of the edge.</p>
  
  <p>For B)My attempt is NO, since if we have a bridge, connecting two graphs, removing that edge will no longer have the graph vertex biconnected.</p>
  
  <p>Perhaps I am totally wrong here, any assistance would be greatly appreciated.</p>