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
Autor principal: Bonomo, Flavia
Publicado: 2017
Materias:
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_09110119_v33_n4_p653_Alcon
http://hdl.handle.net/20.500.12110/paper_09110119_v33_n4_p653_Alcon
Aporte de:
id paper:paper_09110119_v33_n4_p653_Alcon
record_format dspace
spelling paper:paper_09110119_v33_n4_p653_Alcon2023-06-08T15:49:56Z Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs Bonomo, Flavia Block graphs Forbidden induced subgraphs Paths on a grid Vertex intersection 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 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. © 2017, Springer Japan. Fil:Bonomo, F. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2017 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_09110119_v33_n4_p653_Alcon http://hdl.handle.net/20.500.12110/paper_09110119_v33_n4_p653_Alcon
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Block graphs
Forbidden induced subgraphs
Paths on a grid
Vertex intersection graphs
spellingShingle Block graphs
Forbidden induced subgraphs
Paths on a grid
Vertex intersection graphs
Bonomo, Flavia
Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs
topic_facet Block graphs
Forbidden induced subgraphs
Paths on a grid
Vertex intersection graphs
description 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 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. © 2017, Springer Japan.
author Bonomo, Flavia
author_facet Bonomo, Flavia
author_sort Bonomo, Flavia
title Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs
title_short Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs
title_full Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs
title_fullStr Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs
title_full_unstemmed Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs
title_sort vertex intersection graphs of paths on a grid: characterization within block graphs
publishDate 2017
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_09110119_v33_n4_p653_Alcon
http://hdl.handle.net/20.500.12110/paper_09110119_v33_n4_p653_Alcon
work_keys_str_mv AT bonomoflavia vertexintersectiongraphsofpathsonagridcharacterizationwithinblockgraphs
_version_ 1768546166749790208