Toll convexity
A walk W between two non-adjacent vertices in a graph G is called tolled if the first vertex of W is among vertices from W adjacent only to the second vertex of W, and the last vertex of W is among vertices from W adjacent only to the second-last vertex of W. In the resulting interval convexity, a s...
Guardado en:
| Autores principales: | Alcón, Liliana Graciela, Brešar, Boštjan, Gologranc, Tanja, Gutiérrez, Marisa, Šumenjak, Tadeja Kraner, Peterin, Iztok, Tepeh, Aleksandra |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2015
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/85849 |
| Aporte de: |
Ejemplares similares
-
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: Alcón, Liliana Graciela, et al.
Publicado: (2017) -
Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs
por: Bonomo, Flavia
Publicado: (2017) -
The difference between clique graphs and iterated clique graphs
por: De Caria, Pablo Jesús
Publicado: (2011) -
Algebraic theory for the clique operator
por: Gutiérrez, Marisa, et al.
Publicado: (2001)