Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00495606n
Noun Concept
Categories: Graph connectivity
EN
bridge  bridgeless graph  cut-edge  cut arc  cut edge
EN
In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases the graph's number of connected components. Wikipedia
English:
graph
graph theory
Definitions
Relations
Sources
EN
In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases the graph's number of connected components. Wikipedia
An edge whose removal disconnects a graph Wikipedia Disambiguation
An edge which, if removed, changes a connected graph to one that is not connected. Wiktionary
Graph theory. Wiktionary (translation)
IS A
graph property
edge
OPPOSITE OF
biconnected component
STUDIED BY
graph theory
Wikipedia
EN
bridge (graph theory)
Wikidata
EN
bridge
Wiktionary
EN
bridge
Wikipedia Redirections
EN
Bridge (graph), bridgeless graph, cut-edge, cut arc, Cut edge
Wikidata Alias
EN
cut arc, cut edge, isthmus

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License