Figure 3From: Assessing the Exceptionality of Coloured Motifs in NetworksComplete edge binary tree for vertices , and . Branches are labelled according to the presence or absence of edges: label for instance, means that and are connected, whereas means the opposite. Leafs which correspond to connected subgraphs are represented by a square.Back to article page