Compositions of series-parallel graphs
Brian Kell · 2006
A composition of a graph is a partition of the vertex set such that the subgraph induced by each part is connected. In this paper we shall survey past results about compositions of graphs and present a new result which yields a linear-time method for computing the number of compositions of a series-parallel graph.