Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs

We investigate 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, L., Bonomo, F., Mazzoleni, M.P.
Formato: JOUR
Materias:
Block graphs
Forbidden induced subgraphs
Paths on a grid
Vertex intersection graphs
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_09110119_v33_n4_p653_Alcon
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares