## JSON code of the network

{"nodes":["r","g","f","a","e","b","d","c","1","2","3"],"edges": [["r","g"],["g","f"],["f","a"],["a","1"],["r","c"],["c","3"],["g","d"],["d","c"],["d","b"],["b","2"],["f","e"],["e","a"],["e","b"]]}

## Visualization of the network

*r* is the root and the leaves are labeled from 1 to 3.
Arcs are oriented from the parent to the child.

## Classes containing this network or not

### Classes which contain this network (with direct proof)

- binary leaf outerplanar: Easy to check.
- binary level-3: Easy to check.
- binary galled network: All common arcs between reticulation cycles, (
*f*,*e*) and (*g*,*d*), are tree arcs. - binary tree-based: Removing the reticulation arcs (f,a), (e,b) and (d,c) provides a tree this network is based on.
- binary: Easy to check.
- binary FU-stable: No reticulation vertex has a reticulation vertex as its parent, and no two vertices have the same set of children
- binary nearly stable: Vertices a, f and g are stable for leaf 1; vertex b is stable for leaf 2; vertex c is stable for leaf 3; vertices e and d are not stable but their respective parents f and g are.
- binary 1-reticulated: Each tree vertex can reach at most one reticulation vertex by 2 internally vertex-disjoint paths:
*r* can reach *c*, *g* can reach *b* and *f* can reach *a*.

### Classes which do not contain this network (with direct proof)

### All classes

In the inclusion diagram below, the names of classes containing this network are colored green and the name of the classes not containing it are colored red.

## About this website

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.

### How to cite

P. Gambette, M. Morgado, N. Tavassoli & M. Weller (2018)

*ISIPhyNC, an Information System on Inclusions of Phylogenetic Network Classes*, manuscript in preparation.

### Database content

73 classes of phylogenetic networks including 35 classes of binary phylogenetic networks (defined in a total of 20 bibliographic references), 51 inclusion relationships proved directly between classes (including some found in a total of 9 bibliographic references), 24 networks (68 memberships to a class, 56 non-memberships to a class), 3 problems considered, 3 properties considered, 37 theorems proved directly (including some found in a total of 17 bibliographic references) including 26 positive results (which can be extended to subclasses) and 11 negative results (which can be extended to superclasses).