Show that every graph with 3 or more vertices will have a separation edge on the condition that it also has a separation vertex.
I know that a graph of 3 vertices in the shape of a line has 2 separating edges and 1 separation vertex. So it's true for the smallest case.
A separation edge is in multiple biconnected components. But I'm not sure how to link equivalence classes to show that it's true in the general case. Is it enough to say that since a separation vertex belongs to multiple equivalence classes, then it must have a separation edge?