A cut-vertex of a graph is a vertex whose deletion increases the number of components of the graph. The edge analogue of a cut-vertex is a bridge.