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 proved that every graph can be represented as the edge intersection graph of paths on a grid, i.e., one can associate to each vertex of the graph a nontrivial path on a grid such that two vertices are adjacent if and only if the corresponding paths share at least one ed...

Descripción completa

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

Ejemplares similares

Ejemplares similares