# Identifying Cut-Vertices

Learn about cut-vertices of a graph and how to find them by modifying depth-first search.

## Introducing cut-vertices

A **cut-vertex** of a connected graph is a vertex whose removal results in disconnecting the graph.

For example, the labeled vertex in each of the following examples is a cut-vertex because removing it creates two, three, and five components, respectively.

Get hands-on with 1200+ tech skills courses.