Bridge — мост.
1. A bridge of a cycle is the shortest path in joining nonconsecutive vertices of which is shorter than both of the edges of joining those vertices. Thus a chord is a bridge of length 1, and a graph is bridged iff every cycle of length at least 4 has a bridge.
2. A bridge of is an edge whose removal disconnects .
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.