Материал из WikiGrapp
Перейти к:навигация, поиск


1. A bridge of a cycle C is the shortest path in C joining nonconsecutive vertices of C which is shorter than both of the edges of C 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 G is an edge whose removal disconnects G.


  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.