bridge
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.
| Title | bridge |
|---|---|
| Canonical name | Bridge |
| Date of creation | 2013-03-22 12:31:41 |
| Last modified on | 2013-03-22 12:31:41 |
| Owner | digitalis (76) |
| Last modified by | digitalis (76) |
| Numerical id | 5 |
| Author | digitalis (76) |
| Entry type | Definition |
| Classification | msc 05C99 |
| Related topic | Cutvertex |
| Related topic | ConnectedGraph |
| Related topic | Block |