AbstractIt is proved that every k-colourable graph on n vertices has a grid drawing with O(kn) area, and that this bound is best possible. This result can be viewed as a generalisation of the no-three-in-line problem. A further area bound is established that includes the aspect ratio as a parameter
AbstractIt is important to minimize the area of a drawing of a graph, so that the drawing can fit in...
An exact formula is given for the maximum number of edges in a graph that admits a three-dimensional...
A grid drawing of a graph maps vertices to grid points and edges to line segments that avoid grid po...
It is proved that every k-colourable graph on n vertices has a grid drawing with O(kn) area, and tha...
A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer poi...
Abstract. The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number o...
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points i...
A Fary grid drawing of a graph is a drawing on a three-dimensional grid such that vertices are place...
In this paper we contribute to the understanding of the geometric properties of 3D drawings. Namely,...
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 grid drawing of a graph maps vertices to the grid $ℤ^d$ and edges to line segments that avoid grid...
We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line gri...
We show that an outerplanar graph G with n vertices and degree d admits a planar straight-line grid ...
Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing...
AbstractIt is important to minimize the area of a drawing of a graph, so that the drawing can fit in...
An exact formula is given for the maximum number of edges in a graph that admits a three-dimensional...
A grid drawing of a graph maps vertices to grid points and edges to line segments that avoid grid po...
It is proved that every k-colourable graph on n vertices has a grid drawing with O(kn) area, and tha...
A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer poi...
Abstract. The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number o...
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points i...
A Fary grid drawing of a graph is a drawing on a three-dimensional grid such that vertices are place...
In this paper we contribute to the understanding of the geometric properties of 3D drawings. Namely,...
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 grid drawing of a graph maps vertices to the grid $ℤ^d$ and edges to line segments that avoid grid...
We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line gri...
We show that an outerplanar graph G with n vertices and degree d admits a planar straight-line grid ...
Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing...
AbstractIt is important to minimize the area of a drawing of a graph, so that the drawing can fit in...
An exact formula is given for the maximum number of edges in a graph that admits a three-dimensional...
A grid drawing of a graph maps vertices to grid points and edges to line segments that avoid grid po...
DOI
Add to ORKG