Add to ORKG. 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 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 well-known families of graphs such as planar graphs, complete graphs and complete bipartite graphs. 1 Introduction The problem of determining a visibility representation of a graph has been studied extensively in the...
We introduce the visibility number b(G) of a graph G, which is the minimum t such that G can be repr...
We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibili...
We consider visibility representations of graphs in which the vertices are presented by a collection...
We give a visibility representation of graphs which extends some very well-known representations con...
We give a visibility representation of graphs which extends some very well-known representations con...
We give a visibility representation of graphs which extends some very well-known representations con...
This paper proposes a 3-dimensional visibility representation of graphs G = (V; E) in which vertices...
This paper proposes a 3-dimensional visibility representation of graphs G = (V,E) in which vertices ...
After showing that any graph admits a visibility bar-representation in an adequate closed surface, w...
AbstractA visibility representation of a graph G is to represent the nodes of G with non-overlapping...
This paper continues the study of 3D visibility representations of complete graphs where vertices ar...
This paper continues the study of 3D visibility representations of complete graphs where vertices ar...
We study 3D visibility representations of complete graphs where vertices are represented by equal re...
In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are...
In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are...
We introduce the visibility number b(G) of a graph G, which is the minimum t such that G can be repr...
We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibili...
We consider visibility representations of graphs in which the vertices are presented by a collection...
We give a visibility representation of graphs which extends some very well-known representations con...
We give a visibility representation of graphs which extends some very well-known representations con...
We give a visibility representation of graphs which extends some very well-known representations con...
This paper proposes a 3-dimensional visibility representation of graphs G = (V; E) in which vertices...
This paper proposes a 3-dimensional visibility representation of graphs G = (V,E) in which vertices ...
After showing that any graph admits a visibility bar-representation in an adequate closed surface, w...
AbstractA visibility representation of a graph G is to represent the nodes of G with non-overlapping...
This paper continues the study of 3D visibility representations of complete graphs where vertices ar...
This paper continues the study of 3D visibility representations of complete graphs where vertices ar...
We study 3D visibility representations of complete graphs where vertices are represented by equal re...
In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are...
In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are...
We introduce the visibility number b(G) of a graph G, which is the minimum t such that G can be repr...
We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibili...
We consider visibility representations of graphs in which the vertices are presented by a collection...