---
tag: 6V7PY38C5F
kind: concept
name: Edge connectivity
aliases: [k-edge-connected-graph]
sources:
  - wikipedia: en:4593774@r1363592878
    locator: Edge connectivity
    note: adopted
    mention: wikipedia://en/4593774
    sections: [Summary]
same_as:
  wikidata: Q3034655
  wikipedia: Edge connectivity
inventory: [WR0VJX2BY6]
---

## Summary

In graph theory, a connected [[graph|00C0BR7D7H]] is **$k$-edge-connected** if it remains connected whenever fewer than $k$ edges are removed.