Fig. 1
From: Computing all hybridization networks for multiple binary phylogenetic input trees
a A hybridization network N with taxa set \(\mathcal {X}=\{a,b,c,d,e\}\) whose reticulation edges are consecutively numbered. b A phylogenetic \(\mathcal {X}\)-tree T that is displayed by N. Based on N, both edge sets {3,6,1} and {3,6,2} refer to T. c The restricted network \(N|_{E',\mathcal {X}'}\) with E ′={3,6,1} and \(\mathcal {X}'=\{b,c,d,e\}\) still containing nodes of both in- and out-degree 1