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
Wikipedia
Wikipedia Redirections