Bridge (graph theory)

In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases the graph’s number of connected components.[1] Equivalently, an edge is a bridge if and only if it is not contained in any cycle. For a connected graph, a bridge can uniquely determine a cut. A graph is said to be bridgeless or isthmus-free if it contains no bridges.

This type of bridge should be distinguished from an unrelated meaning of “bridge” in graph theory, a subgraph separated from the rest of the graph by a specified subset of vertices; see Glossary of graph theory terms § bridge.

A graph with 16 vertices and 6 bridges (highlighted in red)

An undirected connected graph with no bridge edges

Contents
1 Trees and forests
2 Relation to vertex connectivity
3 Bridgeless graphs
4 Tarjan’s bridge-finding algorithm
5 Bridge-finding with chain decompositions
6 See also