---
res:
  bibo_abstract:
  - 'A drawing of a graph G is radial if the vertices of G are placed on concentric
    circles C 1 , . . . , 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 crossing-free 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 Hanani-Tutte theorem for radial planarity.
    This generalizes a result by Pach and Toth.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Radoslav
      foaf_name: Fulek, Radoslav
      foaf_surname: Fulek
      foaf_workInfoHomepage: http://www.librecat.org/personId=39F3FFE4-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0001-8485-1774
  - foaf_Person:
      foaf_givenName: Michael
      foaf_name: Pelsmajer, Michael
      foaf_surname: Pelsmajer
  - foaf_Person:
      foaf_givenName: Marcus
      foaf_name: Schaefer, Marcus
      foaf_surname: Schaefer
  bibo_doi: 10.7155/jgaa.00408
  bibo_issue: '1'
  bibo_volume: 21
  dct_date: 2017^xs_gYear
  dct_language: eng
  dct_publisher: Brown University@
  dct_title: Hanani-Tutte for radial planarity@
...