Abstract

The well-known DISJOINT PATHS problem is to decide if a graph contains k pairwise disjoint paths, each connecting a different terminal pair from a set of k distinct vertex pairs. We determine, with an exception of two cases, the complexity of the DISJOINT PATHS problem for H-free graphs. If k
... read more