Relationship among B1-EPG, VPT and EPT Graphs Classes

This research contains as a main result the proof that every chordal B1-EPG graph is simultaneously in the graph classes VPT and EPT. In addition, we describe structures that must be present in any B1-EPG graph which does not admit a Helly-B1-EPG representation. In particular, this paper presents so...

Descripción completa

Detalles Bibliográficos
Autores: Alcón, Liliana Graciela, Mazzoleni, María Pía, Santos, Tanilson Dias Dos
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2023
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/221977
Acceso en línea:http://hdl.handle.net/11336/221977
Access Level:acceso abierto
Palabra clave:EDGE-INTERSECTION GRAPH OF PATHS IN A TREE
EDGE-INTERSECTION OF PATHS ON A GRID
HELLY PROPERTY
INTERSECTION GRAPHS
SINGLE BEND PATHS
VERTEX-INTERSECTION GRAPH OF PATHS IN A TREE
https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
Descripción
Sumario:This research contains as a main result the proof that every chordal B1-EPG graph is simultaneously in the graph classes VPT and EPT. In addition, we describe structures that must be present in any B1-EPG graph which does not admit a Helly-B1-EPG representation. In particular, this paper presents some features of non-trivial families of graphs properly contained in Helly-B1-EPG, namely bipartite, block, cactus and line graphs of bipartite graphs.