Home  Issues  Aims and Scope  Instructions for Authors 
Special Issue on Selected papers from the Twentythird International Symposium on Graph Drawing and Network Visualization, GD 2015
DOI: 10.7155/jgaa.00408
HananiTutte for Radial Planarity
Vol. 21, no. 1, pp. 135154, 2017. Regular paper.
Abstract A drawing of a graph $G$ is radial if the vertices of $G$ are placed on concentric circles $C_1, \ldots, C_k$ with common center $c$, and edges are drawn radially: every edge intersects every circle centered at $c$ at most once. $G$ is radial planar if it has a radial embedding, that is, a crossingfree radial drawing. If the vertices of $G$ are ordered or partitioned into ordered levels (as they are for leveled graphs), we require that the assignment of vertices to circles corresponds to the given ordering or leveling.
We show that a graph $G$ is radial planar if $G$ has a radial drawing in which every
two edges cross an even number of times; the radial embedding has the same leveling as the radial drawing.
In other words, we establish the weak variant of the HananiTutte theorem for radial planarity.
This generalizes a result by Pach and Tóth.

Submitted: November 2015.
Reviewed: August 2016.
Revised: September 2016.
Accepted: November 2016.
Final: December 2016.
Published: January 2017.
