We study 3D visibility representations of complete graphs where vertices are represented by equal regular polygons lying in planes parallel to the xy-plane. Edges correspond to the z-parallel visibility among these polygons. We improve the upper bound on the maximum size of a complete graph with a 3D visibility representation by regular n-gons from 2O(n) to O(n4 )
We give a visibility representation of graphs which extends some very well-known representations con...
This paper studies 3-dimensional visibility representations of graphs in which objects in 3-d corres...
We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibili...
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...
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...
The 3D visibility (graph) drawing is a graph drawing in IR3 where vertices are represented by 2D set...
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 ...
This paper considers a 3-dimensional visibility representation of cliques K_n. In this representatio...
This paper considers a 3-dimensional visibility representation of cliques K n . In this representat...
AbstractThis paper studies 3-dimensional visibility representations of graphs in which objects in 3-...
. We give a visibility representation of graphs which extends some very well-known representations c...
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 studies 3-dimensional visibility representations of graphs in which objects in 3-d corres...
We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibili...
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...
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...
The 3D visibility (graph) drawing is a graph drawing in IR3 where vertices are represented by 2D set...
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 ...
This paper considers a 3-dimensional visibility representation of cliques K_n. In this representatio...
This paper considers a 3-dimensional visibility representation of cliques K n . In this representat...
AbstractThis paper studies 3-dimensional visibility representations of graphs in which objects in 3-...
. We give a visibility representation of graphs which extends some very well-known representations c...
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 studies 3-dimensional visibility representations of graphs in which objects in 3-d corres...
We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibili...
DOI
Add to ORKG