-Connected graph — -связный граф.
The concept of -connectedness leads to a structure theorem for arbitrary graphs in terms of -connected components and suggests, in a quite natural way, a tree representation unique up to isomorphism. The leaves of the resulting tree are -connected components and weak vertices, that is, vertices belonging to no -connected component. The structure theorem and the corresponding tree representation provide tools for the study of graphs with a simple -structure, such as -reducible, -extendible, -sparse graphs.
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.