{"author":[{"id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek","orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","first_name":"Radoslav"},{"full_name":"Pelsmajer, Michael","first_name":"Michael","last_name":"Pelsmajer"},{"last_name":"Schaefer","full_name":"Schaefer, Marcus","first_name":"Marcus"}],"doi":"10.1007/978-3-319-50106-2_36","conference":{"end_date":"2016-09-21","start_date":"2016-09-19","name":"GD: Graph Drawing and Network Visualization","location":"Athens, Greece"},"_id":"1164","related_material":{"record":[{"id":"1113","status":"public","relation":"later_version"},{"relation":"earlier_version","status":"public","id":"1595"}]},"alternative_title":["LNCS"],"publication_status":"published","abstract":[{"text":"A 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 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. A pair of edges e and f in a graph is independent if e and f do not share a vertex. We show that a graph G is radial planar if G has a radial drawing in which every two independent edges cross an even number of times; the radial embedding has the same leveling as the radial drawing. In other words, we establish the strong Hanani-Tutte theorem for radial planarity. This characterization yields a very simple algorithm for radial planarity testing.","lang":"eng"}],"volume":9801,"date_updated":"2023-02-23T10:05:57Z","type":"conference","page":"468 - 481","status":"public","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"external_id":{"arxiv":["1608.08662"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"article_processing_charge":"No","department":[{"_id":"UlWa"}],"citation":{"ieee":"R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity II,” presented at the GD: Graph Drawing and Network Visualization, Athens, Greece, 2016, vol. 9801, pp. 468–481.","short":"R. Fulek, M. Pelsmajer, M. Schaefer, in:, Springer, 2016, pp. 468–481.","ama":"Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity II. In: Vol 9801. Springer; 2016:468-481. doi:<a href=\"https://doi.org/10.1007/978-3-319-50106-2_36\">10.1007/978-3-319-50106-2_36</a>","mla":"Fulek, Radoslav, et al. <i>Hanani-Tutte for Radial Planarity II</i>. Vol. 9801, Springer, 2016, pp. 468–81, doi:<a href=\"https://doi.org/10.1007/978-3-319-50106-2_36\">10.1007/978-3-319-50106-2_36</a>.","apa":"Fulek, R., Pelsmajer, M., &#38; Schaefer, M. (2016). Hanani-Tutte for radial planarity II (Vol. 9801, pp. 468–481). Presented at the GD: Graph Drawing and Network Visualization, Athens, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-319-50106-2_36\">https://doi.org/10.1007/978-3-319-50106-2_36</a>","ista":"Fulek R, Pelsmajer M, Schaefer M. 2016. Hanani-Tutte for radial planarity II. GD: Graph Drawing and Network Visualization, LNCS, vol. 9801, 468–481.","chicago":"Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity II,” 9801:468–81. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-50106-2_36\">https://doi.org/10.1007/978-3-319-50106-2_36</a>."},"date_created":"2018-12-11T11:50:29Z","month":"12","main_file_link":[{"url":"https://arxiv.org/abs/1608.08662","open_access":"1"}],"title":"Hanani-Tutte for radial planarity II","quality_controlled":"1","scopus_import":1,"oa_version":"Preprint","publist_id":"6193","intvolume":"      9801","language":[{"iso":"eng"}],"ec_funded":1,"publisher":"Springer","year":"2016","day":"08","date_published":"2016-12-08T00:00:00Z"}