On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid

Mostrar todas las versiones(2)

Golumbic, Lipshteyn and Stern [12] proved that every graph can be represented as the edge intersection graph of paths on a grid (EPG graph), i.e., one can associate with each vertex of the graph a nontrivial path on a rectangular grid such that two vertices are adjacent if and only if the correspond...

Descripción completa

Detalles Bibliográficos
Autores principales: Alcón, L., Bonomo, F., Durán, G., Gutierrez, M., Mazzoleni, M.P., Ries, B., Valencia-Pabon, M.
Formato: JOUR
Materias:
(normal, Helly) circular-arc graphs
Edge intersection graphs
Forbidden induced subgraphs
Paths on a grid
Powers of cycles
Geometry
Graphic methods
Circular-arc graph
Intersection graph
Graph theory
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0166218X_v234_n_p12_Alcon
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares