Bridge (graph theory)

From Wikipedia, the free encyclopedia

You have new messages (last change).

In graph theory, a bridge (also known as a cut-edge or an isthmus) is an edge whose deletion increases the number of components. Equivalently, and edge is a bridge if and only if it is not contained in any cycle.

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../b/r/i/Bridge_%28graph_theory%29.html"