HananiTutte for Radial PlanarityFulek, Radoslav and Pelsmajer, Michael J. and Schaefer, Marcus (2015) HananiTutte for Radial Planarity. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 2426, 2015 , pp. 99110(Official URL: http://dx.doi.org/10.1007/9783319272610_9). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/9783319272610_9
AbstractA drawing of a graph G is radial if the vertices of G are placed on concentric circles C1,…,Ck 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.
Actions (login required)
