Artículo
On a visibility representation of graphs
Autor/es | Cobos Gavala, Javier
Dana Jiménez, Juan Carlos Hurtado, Ferrán Márquez Pérez, Alberto Mateos Mateos, Felipe |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 1996 |
Fecha de depósito | 2016-01-27 |
Publicado en |
|
Resumen | We give a visibility representation of graphs which extends some very well-known representations considered extensively in the literature. Concretely, the vertices are represented by a collection of parallel hyper-rectangles ... We give a visibility representation of graphs which extends some very well-known representations considered extensively in the literature. Concretely, the vertices are represented by a collection of parallel hyper-rectangles in R n and the visibility is orthogonal to those hyper-rectangles. With this generalization, we can prove that each graph admits a visibility representation. But, it arises the problem of determining the minimum Euclidean space where such representation is possible. We consider this problem for concrete well-known families of graphs such as planar graphs, complete graphs and complete bipartite graphs. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
On a visibility.pdf | 392.5Kb | [PDF] | Ver/ | |