K-edge-connected graph
= K-edge-connected graph
{wiki=K-edge-connected_graph}
A **k-edge-connected graph** is a type of graph in which there are at least \\( k \\) edges that need to be removed in order to disconnect the graph, meaning that no matter how the edges are removed, there will always be at least \\( k \\) edges remaining that maintain connectivity between pairs of vertices.