A tight relation between series-parallel graphs and bipartite distance hereditary graphs
Bandelt and Mulder's structural characterization of bipartite distance hereditary graphs
16 asserts that such graphs can be built inductively starting from a single vertex and by re-
17 peatedly adding either pendant vertices or twins (i.e., vertices with the same neighborhood
18 as an existing one). Dirac and Duffin's structural characterization of 2-connected series-
19 parallel graphs asserts that such graphs can be built inductively starting from a single edge
20 by adding either edges in series or in parallel.