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