Zwei Untergraphen ${\displaystyle {}H_{1}=(V_{1},E_{1})\subseteq G}$ und ${\displaystyle {}H_{2}=(V_{2},E_{2})\subseteq G}$ in einem Graphen ${\displaystyle {}G=(V,E)}$ heißen kantendisjunkt, wenn ${\displaystyle {}E_{1}\cap E_{2}=\emptyset }$ ist.