Partial and Perfect Path Covers of Cographs

A set P of disjoint paths in a graph G is called a (complete) path cover of G if every vertex of G belongs to one of the paths in P. A path cover of any subgraph of G is called a partial path cover of G. For fixe