Critically k-connected graph

Critically [math]\displaystyle{ k }[/math]-connected graph — критический [math]\displaystyle{ k }[/math]-связный граф.

A [math]\displaystyle{ k }[/math]-connected graph [math]\displaystyle{ G }[/math] is said to be critically [math]\displaystyle{ k }[/math]-connected if [math]\displaystyle{ G - v }[/math] is not [math]\displaystyle{ k }[/math]-connected for any [math]\displaystyle{ v \in V(G) }[/math].

Литература

• Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.