Opened Access On a visibility representation of graphs

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: 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: 1996
Publicado en: Graph Drawing, 1027, 152-161.
Tipo de documento: Artículo
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 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.
Tamaño: 392.5Kb
Formato: PDF

URI: http://hdl.handle.net/11441/33415

DOI: http://dx.doi.org/10.1007/BFb0021799

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones