proved directly:
network #14 : The common arcs between the two reticulation cycles are (r,a) and (r,d), which are tree arcs.
network #7 : The common arcs between the two reticulation cycles are (r,a) and (r,e), which are tree arcs.
network #1 : All common arcs between reticulation cycles, (f,e) and (g,d), are tree arcs.
network #21 : All common arcs between reticulation cycles, (r,a), (a,b), (b,d) and (r,g) are tree arcs.
network #2 : All common arcs between reticulation cycles, (b,d) and (a,e), are tree arcs.
network #18 : All common arcs between reticulation cycles, (a,c), (d,f) and (g,i), are tree arcs.
Deduced from class inclusions: network #5 (deduced from the inclusion of "binary unicyclic" in this class), network #6 (deduced from the inclusion of "binary galled tree" in this class)
Proved directly:
network #13 : Reticulation arc (a,d) is a common arc of reticulation cycles from r to d and from a to c.
network #8 : Reticulation arc (d,g) is a common arc of reticulation cycles from r to g and from d to f.
network #4 : Reticulation arc (c,e) is a common arc of reticulation cycles from b to e and from c to d.
Deduced from class inclusions: network #12 (deduced from the inclusion of this class in "binary compressed"), network #11 (deduced from the inclusion of this class in "binary reticulation-visible"), network #10 (deduced from the inclusion of this class in "binary tree-based"), network #24 (deduced from the inclusion of this class in "binary reticulation-visible"), network #3 (deduced from the inclusion of this class in "binary tree-based")
This website was programmed and is maintained by Philippe Gambette. It was started during the internship of Maxime Morgado at LIGM, in June-July 2015, and also contains contributions made from Narges Tavassoli from November 2016 to January 2017.
Please contact Philippe Gambette if you have any suggestions about this website, especially about problems, properties, results or subclasses to add.