Using SPQR-trees to speed up algorithms based on 2-cutset decompositions

We propose the use of SPQR-trees as a data structure to encode the 3-connected components of a graph and to obtain linear-time recognition algorithms for graph classes structurally characterized by 2-cutset decompositions.