Bridges and Cycles in Graphs

An edge is a bridge exactly when it lies on no cycle, so a bridgeless graph is one in which every edge sits on some cycle.