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 graph if there is no edge cut set of [math]\displaystyle{ G }[/math] of cardinality less than [math]\displaystyle{ k }[/math].