K-Edge connected graph

[math]\displaystyle{ k }[/math]-Edge connected graph --- [math]\displaystyle{ k }[/math]-реберно связный граф.

A graph [math]\displaystyle{ G }[/math] is [math]\displaystyle{ k }[/math]-edge connected if there exist [math]\displaystyle{ k }[/math] internally edge-disjoint chains between every pair of distinct nodes in [math]\displaystyle{ G }[/math].