Intersection graphs of vertex disjoint paths in a tree Original Research Article

Two characterizations of intersection graphs of vertex disjoint paths in a tree, one in terms of maximal clique separator and the other in terms of minimal forbidden subgraphs, are presented. A polynomial recognition algorithm for this class is suggested.