connected component of a graph
maximal subgraph of a given node-link graph within which every two vertices may be connected by a path
strongly connected component
subgraph of a directed graph containing paths in both directions between each pair of vertices
Kempe chain
part of the four-colour theorem