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

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