Buscar
Mostrando ítems 1-7 de 7
Asteroidal quadruples in non rooted path graphs
(Discussiones Mathematicae Graph Theory, 2015-01)
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are ...
On Models of Directed Path Graphs Non Rooted Directed Path Graphs
(Springer Tokyo, 2016-03)
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted directed path graph is the intersection graph of a family of directed subpaths of a rooted tree. Clearly, rooted ...
On rooted directed path graphs
(Unión Matemática Argentina, 2016-06)
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. An asteroidal quadruple is a stable set of four vertices such that any three ...