In graph theory, what is a bottleneck of a graph?
A minimal cut-edge that separates two large subgraphs
A vertex of degree 1
An edge whose removal increases the number of components by more than one
The longest path in the graph