Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03628853n
Noun Concept
ES
No term available
EN
In graph theory, a connected graph G is said to be k-vertex-connected if it has more than k vertices and remains connected whenever fewer than k vertices are removed. Wikipedia
Relations
Sources
IS A
grafo conexo
HAS KIND
grafo poliédrico
EN
biconnected graph
mycielskian
HAS INSTANCE
EN
Harries–Wong graph
10-jaula de Balaban
EN
Franklin graph
EN
Balaban 11-cage
gráfico frucht
+11 relations
OPPOSITE OF
EN
k-edge-connected graph
STUDIED BY
teoría de 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