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