dc.creatorAlcón, Liliana Graciela
dc.creatorBonomo, Flavia
dc.creatorMazzoleni, María Pía
dc.date2017-05-25
dc.date2022-02-09T17:53:05Z
dc.date.accessioned2023-07-15T04:18:26Z
dc.date.available2023-07-15T04:18:26Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/130780
dc.identifierissn:0911-0119
dc.identifierissn:1435-5914
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7469043
dc.descriptionWeinvestigate 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 present a minimal forbidden induced subgraph characterization of B0-VPG graphs restricted to block graphs. As a byproduct, the proof of the main theorem provides an alternative certifying recognition and representation algorithm for B0-VPG graphs in the class of block graphs.
dc.descriptionDepartamento de Matemática
dc.descriptionUniversidad de Buenos Aires
dc.descriptionConsejo Nacional de Investigaciones Científicas y Técnicas
dc.formatapplication/pdf
dc.format653-664
dc.languageen
dc.rightshttp://creativecommons.org/licenses/by-nc-sa/4.0/
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.subjectMatemática
dc.subjectvertex intersection graphs
dc.subjectpaths on a grid
dc.subjectforbidden induced subgraphs
dc.subjectblock graphs
dc.titleVertex intersection graphs of paths on a grid: characterization within block graphs
dc.typeArticulo
dc.typePreprint


Este ítem pertenece a la siguiente institución