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...

Descripción completa

Detalles Bibliográficos
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:
Ciencias Exactas
Matemática
Graph in graph theory
Vertex of a graph
Detour monophonic
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/85849
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Ejemplares similares