In: Advanced Math
GRAPH THEORY
Prove/Show that a connected Graph G is not separable if and only if it is nonseparable.
Definitions for Reference: A connected Graph G is called nonseparable if it has no cut vertices (A vertex v in a connected graph G is caled a cut vertex if G-v is disconnected)
A connected graph G is called separable if there exist subgraphs H1, H2 ⊂ G. with E(H1) ∪ E(H2) = E(G) and E(H1) ∩ E(H2) = ∅. V (H1) ∪ V (H2) =V (G) and V (H1) ∩ V (H2) containing a single vertex.