The forbidden subgraph characterization of directed vertex graphs Original Research Article

A graph is called a directed vertex (DV) graph if it is the intersection graph of a family of directed paths in a directed tree, i.e., a tree in which each edge is oriented, with one or more vertices of indegree zero. In this paper we present the forbidden subgraph characterization of DV graphs.