On some special classes of contact B<sub>0</sub>-VPG graphs

A graph G is a B<sub>0</sub>-VPG graph if one can associate a horizontal or vertical path on a rectangular grid with each vertex such that two vertices are adjacent if and only if the corresponding paths intersect in at least one grid-point. A graph G is a contact B<sub>0</sub&g...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo Braberman, Flavia, Mazzoleni, María Pía, Rean, Mariano Leonardo, Ries, Bernard
Formato: Articulo Preprint
Lenguaje:Inglés
Publicado: 2019
Materias:
Ciencias Exactas
Matemática
contact B 0-VPG graph
chordal graph
tree-cograph
P4-tidy graph
P5-free graph
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/125545
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Ejemplares similares