bn:03280524n
Noun Concept
Categories: Graph connectivity, Graph families
EN
biconnected graph  2-connected graph  Bi-connected graph
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
Definitions
Relations
Sources
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
Wikipedia
Wikidata
Wikipedia Redirections
Wikidata Alias