Straight-line Drawings of 1-Planar Graphs

09/03/2021
by   Franz J. Brandenburg, et al.
0

A graph is 1-planar if it can be drawn in the plane so that each edge is crossed at most once. However, there are 1-planar graphs which do not admit a straight-line 1-planar drawing. We show that every 1-planar graph has a straight-line drawing with a two-coloring of the edges, so that edges of the same color do not cross. Hence, 1-planar graphs have geometric thickness two. In addition, each edge is crossed by edges with a common vertex if it is crossed more than twice. The drawings use high precision arithmetic with numbers with O(n log n) digits and can be computed in linear time from a 1-planar drawing

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2018

Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends

We study the following classes of beyond-planar graphs: 1-planar, IC-pla...
research
01/03/2022

On Optimal Beyond-Planar Graphs

A graph is beyond-planar if it can be drawn in the plane with a specific...
research
08/08/2018

Separators for Planar Graphs that are Almost Trees

We prove that a connected planar graph with n vertices and n+μ edges has...
research
08/30/2021

Simplifying Non-Simple Fan-Planar Drawings

A drawing of a graph is fan-planar if the edges intersecting a common ed...
research
07/17/2023

Drawing non-planar graphs with rotation systems on the Klein bottle

This paper provides a linear time algorithm in the number of edges that,...
research
04/25/2021

Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest

1-planar graphs are graphs that can be drawn in the plane such that any ...
research
04/14/2023

Identifying Cluttering Edges in Near-Planar Graphs

Planar drawings of graphs tend to be favored over non-planar drawings. T...

Please sign up or login with your details

Forgot password? Click here to reset