graph-connectivity
Articles
- Giant componentLarge connected component of a random graph
- Vertex separatorSet of graph nodes which separate a given pair of nodes if removed
- Vertex connectivityGraph which remains connected when k or fewer nodes removed
- Connectivity (graph theory)Basic concept of graph theory
- St-connectivity
- ReachabilityWhether one vertex can be reached from another in a graph
- Strongly connected componentPartition of a graph whose components are reachable from all vertices
- Biconnected componentMaximal biconnected subgraph
- Bridge (graph theory)Edge whose deletion would disconnect a graph
- Strongly connected componentPartition of a graph whose components are reachable from all vertices
- Biconnected componentMaximal biconnected subgraph
- Vertex connectivityGraph which remains connected when k or fewer nodes removed
- Connectivity (graph theory)Basic concept of graph theory
- Graph toughness
- Vertex separatorSet of graph nodes which separate a given pair of nodes if removed
- Giant componentLarge connected component of a random graph
- Vertex connectivityGraph which remains connected when k or fewer nodes removed
- Connectivity (graph theory)Basic concept of graph theory
- Vertex separatorSet of graph nodes which separate a given pair of nodes if removed
- Strongly connected componentPartition of a graph whose components are reachable from all vertices
- Biconnected componentMaximal biconnected subgraph
- Giant componentLarge connected component of a random graph
- Cut (graph theory)Partition of a graph's nodes into 2 disjoint subsets
- Edge connectivityGraph which remains connected when fewer than k edges are removed
- Giant componentLarge connected component of a random graph
- Vertex connectivityGraph which remains connected when k or fewer nodes removed
- Connectivity (graph theory)Basic concept of graph theory
- Strongly connected componentPartition of a graph whose components are reachable from all vertices
- Biconnected componentMaximal biconnected subgraph
- Vertex separatorSet of graph nodes which separate a given pair of nodes if removed
- Cycle rankConnectivity measure in graph theory
- Strength of a graphGraph-theoretic connectivity parameter