k-edge-connected graph

In graph theory, a connected graph is $k$ -edge-connected if it remains connected whenever fewer than $k$ edges are removed.

The edge-connectivity of a graph is the largest $k$ for which the graph is $k$ -edge-connected.

Edge connectivity and the enumeration of $k$ -edge-connected graphs was studied by Camille Jordan in 1869.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.