Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

22

LATIN
2016
Springer

favoriteEmaildiscussreport

72views Information Technology» more LATIN 2016»

Graph Drawings with One Bend and Few Slopes

8 years 14 days ago

Graph Drawings with One Bend and Few Slopes

Download pageperso.lif.univ-mrs.fr

We consider drawings of graphs in the plane in which edges are represented by polygonal paths with at most one bend and the number of diﬀerent slopes used by all segments of these paths is small. We prove that ∆ 2 edge slopes suﬃce for outerplanar drawings of outerplanar graphs with maximum degree ∆ 3. This matches the obvious lower bound. We also show that ∆ 2 + 1 edge slopes suﬃce for drawings of

Kolja Knauer, Bartosz Walczak

Real-time Traffic

Information Technology | LATIN 2016 |

claim paper

Related Content

» Graph drawings with few slopes

» Drawings of planar graphs with few slopes and segments

» Really Straight Graph Drawings

» Orthogonal Drawings with Few Layers

» Drawing Kn in Three Dimensions with One Bend Per Edge

» Simultaneous Embedding of Planar Graphs with Few Bends

» Orthogonal Drawings of SeriesParallel Graphs with Minimum Bends

» Universal Sets of n Points for 1Bend Drawings of Planar Graphs with n Vertices

» Universal Sets of n Points for Onebend Drawings of Planar Graphs with n Vertices

» Threedimensional 1bend graph drawings

Post Info
More Details (n/a)

Added	07 Apr 2016
Updated	07 Apr 2016
Type	Journal
Year	2016
Where	LATIN
Authors	Kolja Knauer, Bartosz Walczak

Comments (0)