On a Visibility Representation of GraphsCobos, F. J. and Dana, J. C. and Hurtado, Ferran and Márquez, Alberto and Mateos, F. (1996) On a Visibility Representation of Graphs. In: Symposium on Graph Drawing, GD 1995, September 2022, 1995 , pp. 152161(Official URL: http://dx.doi.org/10.1007/BFb0021799). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/BFb0021799
AbstractWe give a visibility representation of graphs which extends some very wellknown representations considered extensively in the literature. Concretely, the vertices are represented by a collection of parallel hyperrectangles in R^n and the visibility is orthogonal to those hyperrectangles. 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 wellknown families of graphs such as planar graphs, complete graphs and complete bipartite graphs.
Actions (login required)
