Figure 17From: A unifying model of genome evolution under parsimonyDemonstrating Lemma 31. (A) A junction adjacency with incidence transmission of 0 in a G-bounded AVG. (B) Ignoring the grey elements, if the adjacency e in a G-bounded graph is a G-reducible junction adjacency with no projected incidences and no hanging endpoints, a larger graph, shown by the elements in grey, exists that is H-bounded for a graph H with the same number of adjacencies as G.Back to article page