 Cut vertex

A vertex whose deletion increases the number of connected components of a graph. A Hamiltonian graph has no cut vertex: deleting a vertex from a Hamilton cycle leaves a spanning path.