Directed edge path graphs are the intersection graphs of directed paths in a directed tree, viewed as sets of edges. They were studied by Monma and Wei (J. Comb. Theory B 41 (1986) 141-181) who also gave a polynomial time recognition algorithm. In this work, we show that the clique graphs of these graphs are exactly the two sections of the same kind of path families, and give a polynomial time recognition algorithm for them. (C) 2002 Elsevier Science B.V. All rights reserved.1264170029730
AbstractLet F be a finite family of nonempty sets. The undirected graph G is called the intersection...
The clique operator K maps a graph G into its clique graph, which is the intersection graph of the (...
Abstract. Let T = (V,A) be a directed tree. Given a collection P of dipaths on T, we can look at the...
Abstract Directed edge path graphs are the intersection graphs of directed paths in a directed tree,...
AbstractDirected edge path graphs are the intersection graphs of directed paths in a directed tree, ...
A path graph is the intersection graph of paths in a tree. A directed path graph is the intersectio...
AbstractConsider a finite family of non-empty sets. The intersection graph of this family is obtaine...
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a di...
An intersection graph for a set of sets $C$ is a graph $G$ together with a bijection from the verti...
AbstractWe describe characterizations for the classes of clique graphs of directed and rooted path g...
AbstractThe edge clique graph of a graph H is the one having the edge set of H as vertex set, two ve...
AbstractThe intersection graph for a family of sets is obtained by associating each set with a verte...
Path graphs are intersection graphs of paths in a tree. We start from the characterization of path g...
We present a unifying procedure for recognizing intersection graphs of Helly families of paths in a ...
AbstractTwo characterizations of intersection graphs of vertex disjoint paths in a tree, one in term...
AbstractLet F be a finite family of nonempty sets. The undirected graph G is called the intersection...
The clique operator K maps a graph G into its clique graph, which is the intersection graph of the (...
Abstract. Let T = (V,A) be a directed tree. Given a collection P of dipaths on T, we can look at the...
Abstract Directed edge path graphs are the intersection graphs of directed paths in a directed tree,...
AbstractDirected edge path graphs are the intersection graphs of directed paths in a directed tree, ...
A path graph is the intersection graph of paths in a tree. A directed path graph is the intersectio...
AbstractConsider a finite family of non-empty sets. The intersection graph of this family is obtaine...
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a di...
An intersection graph for a set of sets $C$ is a graph $G$ together with a bijection from the verti...
AbstractWe describe characterizations for the classes of clique graphs of directed and rooted path g...
AbstractThe edge clique graph of a graph H is the one having the edge set of H as vertex set, two ve...
AbstractThe intersection graph for a family of sets is obtained by associating each set with a verte...
Path graphs are intersection graphs of paths in a tree. We start from the characterization of path g...
We present a unifying procedure for recognizing intersection graphs of Helly families of paths in a ...
AbstractTwo characterizations of intersection graphs of vertex disjoint paths in a tree, one in term...
AbstractLet F be a finite family of nonempty sets. The undirected graph G is called the intersection...
The clique operator K maps a graph G into its clique graph, which is the intersection graph of the (...
Abstract. Let T = (V,A) be a directed tree. Given a collection P of dipaths on T, we can look at the...