Vertex intersection graphs of paths on a grid: characterization within block graphs

Mostrar todas las versiones(2)

Weinvestigate graphs that can be represented as vertex intersections of horizontal and vertical paths in a grid, the so called B0-VPG graphs. Recognizing this class is an NP-complete problem. Although, there exists a polynomial time algorithm for recognizing chordal B0-VPG graphs. In this paper, we...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Alcón, Liliana Graciela, Bonomo, Flavia, Mazzoleni, María Pía
Formato: Articulo Preprint
Lenguaje:Inglés
Publicado: 2017
Materias:
Matemática
vertex intersection graphs
paths on a grid
forbidden induced subgraphs
block graphs
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/130780
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Ejemplares similares