Special asteroidal quadruple on directed path graph non rooted path graph
An asteroidal triple in a graph G is a set of three non- adjacent vertices such that for any two of them there exists a path be- tween them that does not intersect the neighborhood of the third. Special asteroidal triple in a graph G is an asteroidal triple such that each pair is linked by a special...
Guardado en:
| Autores principales: | Gutierrez, M., Tondato, Silvia Beatriz |
|---|---|
| Formato: | Objeto de conferencia Resumen |
| Lenguaje: | Inglés |
| Publicado: |
2013
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/94552 |
| Aporte de: |
Ejemplares similares
-
Asteroidal quadruples in non rooted path graphs
por: Gutiérrez, Marisa, et al.
Publicado: (2015) -
On Models of Directed Path Graphs Non Rooted Directed Path Graphs
por: Gutiérrez, Marisa, et al.
Publicado: (2016) -
On rooted directed path graphs
por: Tondato, Silvia Beatriz, et al.
Publicado: (2016) -
Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs
por: Alcón, L., et al. -
Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs
por: Bonomo, Flavia
Publicado: (2017)