On rooted directed path graphs
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 of them is an asteroidal triple. Two non adjacent vertices are linked by a spe...
Guardado en:
| Autores principales: | Tondato, Silvia Beatriz, Gutiérrez, Marisa |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2016
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/95936 https://ri.conicet.gov.ar/11336/55216 http://inmabb.criba.edu.ar/revuma/pdf/v57n1/v57n1a09.pdf http://inmabb.criba.edu.ar/revuma/revuma.php?p=toc/vol57 |
| Aporte de: |
Ejemplares similares
-
On Models of Directed Path Graphs Non Rooted Directed Path Graphs
por: Gutiérrez, Marisa, et al.
Publicado: (2016) -
Asteroidal quadruples in non rooted path graphs
por: Gutiérrez, Marisa, et al.
Publicado: (2015) -
Special asteroidal quadruple on directed path graph non rooted path graph
por: Gutierrez, M., et al.
Publicado: (2013) -
From path graphs to directed path graphs
por: Chaplick, Steven, et al.
Publicado: (2010) -
End simplicial vertices in path graphs
por: Gutiérrez, Marisa, et al.
Publicado: (2016)