Title of article
The forbidden subgraph characterization of directed vertex graphs Original Research Article
Author/Authors
B.S. Panda، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
18
From page
239
To page
256
Abstract
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.
Keywords
Forbidden subgraph , Chordal graph , Directed vertex graph , Intersection graph , Perfect graph
Journal title
Discrete Mathematics
Serial Year
1999
Journal title
Discrete Mathematics
Record number
951703
Link To Document