Edge-Disjoint Subgraphs

Topics: Subgraph - Disjoint Set - Graph Theory

---

(definition)

Two subgraphs $g_1$ and $g_2$ of a graph $G$ are said to be edge-disjoint subgraphs (or edge-separate subgraphs) if they don’t share any edges.

Edge disjoint subgraphs may share vertices.

There are also vertex-disjoint subgraphs.