Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03280524n
Noun Concept
PT
No term available
EN
In graph theory, a biconnected graph is a connected and "nonseparable" graph, meaning that if any one vertex were to be removed, the graph will remain connected. Wikipedia
Relations
Sources
IS A
grafo k-vertice-conexo
HAS KIND
vértice de corte
DOES NOT HAVE PART
vértice de corte
DOES NOT HAVE QUALITY
vértice de corte
STUDIED BY
teoria dos grafos

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