Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03222935n
Noun Concept
SYL
No term available
EN
In graph theory, a connected graph is k-edge-connected if it remains connected whenever fewer than k edges are removed. Wikipedia
Relations
Sources
IS A
EN
connected graph
HAS INSTANCE
EN
Harries–Wong graph
EN
Balaban 10-cage
EN
Franklin graph
EN
Balaban 11-cage
EN
Nauru graph
+7 relations
OPPOSITE OF
EN
k-vertex-connected graph
STUDIED BY
EN
graph theory

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