Category:Vertex Cuts
Jump to navigation
Jump to search
This category contains results about Vertex Cuts.
Let $G = \struct {V, E}$ be a graph.
A vertex cut of $G$ is a set of vertices $W \subseteq \map V G$ such that the vertex deletion $G \setminus W$ is disconnected.
Pages in category "Vertex Cuts"
The following 2 pages are in this category, out of 2 total.