Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings

06/11/2019
by   David Eppstein, et al.
0

We find a family of planar bipartite graphs all of whose Lombardi drawings (drawings with circular arcs for edges, meeting at equal angles at the vertices) are nonplanar. We also find families of embedded series-parallel graphs and apex-trees (graphs formed by adding one vertex to a tree) for which there is no planar Lombardi drawing consistent with the given embedding.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/12/2019

Cubic Planar Graphs that cannot be Drawn on few Lines

For every integer ℓ, we construct a cubic 3-vertex-connected planar bipa...
research
07/08/2021

Angles of Arc-Polygons and Lombardi Drawings of Cacti

We characterize the triples of interior angles that are possible in non-...
research
03/10/2020

Drawing Graphs with Circular Arcs and Right-Angle Crossings

In a RAC drawing of a graph, vertices are represented by points in the p...
research
08/25/2022

The thickness of fan-planar graphs is at most three

We prove that in any strongly fan-planar drawing of a graph G the edges ...
research
12/28/2017

Beyond-Planarity: Density Results for Bipartite Graphs

Beyond-planarity focuses on the study of geometric and topological graph...
research
07/15/2020

How to Morph Graphs on the Torus

We present the first algorithm to morph graphs on the torus. Given two i...
research
08/17/2015

Knuthian Drawings of Series-Parallel Flowcharts

Inspired by a classic paper by Knuth, we revisit the problem of drawing ...

Please sign up or login with your details

Forgot password? Click here to reset