In this paper we contribute to the understanding of the geometric properties of 3D drawings. Namely, we show how to make a 3D straight-line grid drawing of 4-colorable graphs in O(n(2)) volume. Moreover, we prove that each bipartite graph needs at least Omega(n(3/2)) volume. (C) 1997 Elsevier Science B.V
A grid drawing of a plane graph G is a drawing of G on the plane so that all vertices of G are put o...
This is an overview of results and open problems pertaining to straight-line drawings of graphs in ...
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the addi...
A Fary grid drawing of a graph is a drawing on a three-dimensional grid such that vertices are place...
A Fary grid drawing of a graph is a drawing on a three-dimensional grid such that vertices are place...
We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line gri...
A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer poi...
We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line gri...
AbstractThis paper investigates the basic problem of computing crossing-free straight-line 3D grid d...
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with i...
It is proved that every k-colourable graph on n vertices has a grid drawing with O(kn) area, and tha...
AbstractIt is proved that every k-colourable graph on n vertices has a grid drawing with O(kn) area,...
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points i...
Graph drawing research has been mostly oriented toward two-dimensional drawings. This paper describe...
Abstract. The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number o...
A grid drawing of a plane graph G is a drawing of G on the plane so that all vertices of G are put o...
This is an overview of results and open problems pertaining to straight-line drawings of graphs in ...
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the addi...
A Fary grid drawing of a graph is a drawing on a three-dimensional grid such that vertices are place...
A Fary grid drawing of a graph is a drawing on a three-dimensional grid such that vertices are place...
We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line gri...
A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer poi...
We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line gri...
AbstractThis paper investigates the basic problem of computing crossing-free straight-line 3D grid d...
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with i...
It is proved that every k-colourable graph on n vertices has a grid drawing with O(kn) area, and tha...
AbstractIt is proved that every k-colourable graph on n vertices has a grid drawing with O(kn) area,...
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points i...
Graph drawing research has been mostly oriented toward two-dimensional drawings. This paper describe...
Abstract. The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number o...
A grid drawing of a plane graph G is a drawing of G on the plane so that all vertices of G are put o...
This is an overview of results and open problems pertaining to straight-line drawings of graphs in ...
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the addi...
DOI
Add to ORKG