On PVPG graphs: a subclass of vertex intersection graphs of paths on a grid
In this paper, we study the class of PVPG graphs, this is a subclass of VPG graphs such that all the representing paths are between two parallel lines of the grid and have their endpoints on these lines. We prove that PVPG = Co-comparability. Moreover, we present some minimal forbidden induced subgr...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2021 |
| País: | Argentina |
| Institución: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/164141 |
| Acceso en línea: | http://hdl.handle.net/11336/164141 |
| Access Level: | acceso abierto |
| Palabra clave: | VERTEX INTERSECTION GRAPHS GRIDS CO-COMPARABILITY GRAPHS https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
| Sumario: | In this paper, we study the class of PVPG graphs, this is a subclass of VPG graphs such that all the representing paths are between two parallel lines of the grid and have their endpoints on these lines. We prove that PVPG = Co-comparability. Moreover, we present some minimal forbidden induced subgraphs for the class of B1-PVPG graphs. |
|---|