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