the edge - disjoint paths problem is np - complete for series - parallel graphs .
The monadic second-order logic of graphs I. Recognizable sets of Finite Graphs