The planar slope number of a planar graph $ G $ is defined as the minimum number of
slopes that is required for a crossing-free straight-line drawing of $ G $. We show that …

A subcubic planar graph is a planar graph whose vertices have degree at most 3. We show
that the subcubic planar graphs with at least five vertices have planar slope number at most …

A graph is outer 1-planar if it admits a drawing where each vertex is on the outer face and
each edge is crossed by at most another edge. Outer 1-planar graphs are a superclass of …

In an upward planar 2-slope drawing of a digraph, edges are drawn as straight-line
segments in the upward direction without crossings using only two different slopes. We …

We study a classic problem introduced thirty years ago by Eades and Wormald. Let G=(V, E,
λ) be a weighted planar graph, where λ: E→ R+ is a length function. The Fixed Edge-Length …

A subcubic planar graph is a planar graph whose vertices have degree at most three. We
show that the subcubic planar graphs with at least five vertices have planar slope number at …

Graph drawing addresses the problem of constructing geometric representations of graphs,
and has important applications to key computer technologies such as software engineering …

It is proved that every series-parallel digraph whose maximum vertex degree is Δ admits an
upward planar drawing with at most one bend per edge such that each edge segment has …

We prove that every set of\varDelta-1 Δ-1 slopes is 1-bend universal for the planar graphs
with maximum vertex degree\varDelta Δ. This means that any planar graph with maximum …

The planar slope number psn (G) of a planar graph G is the minimum number of edge
slopes in a planar straight-line drawing of G. It is known that psn (G)∈ O (c Δ) for every …