{"abstract":[{"text":"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.","lang":"eng"}],"title":"Hanani-Tutte for radial planarity","intvolume":"        21","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"scopus_import":1,"oa":1,"day":"01","publisher":"Brown University","date_updated":"2023-02-23T10:05:57Z","date_published":"2017-01-01T00:00:00Z","department":[{"_id":"UlWa"}],"ec_funded":1,"_id":"1113","article_processing_charge":"No","project":[{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"external_id":{"arxiv":["1608.08662"]},"author":[{"first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","last_name":"Fulek"},{"full_name":"Pelsmajer, Michael","last_name":"Pelsmajer","first_name":"Michael"},{"first_name":"Marcus","last_name":"Schaefer","full_name":"Schaefer, Marcus"}],"doi":"10.7155/jgaa.00408","issue":"1","type":"journal_article","citation":{"ama":"Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity. <i>Journal of Graph Algorithms and Applications</i>. 2017;21(1):135-154. doi:<a href=\"https://doi.org/10.7155/jgaa.00408\">10.7155/jgaa.00408</a>","mla":"Fulek, Radoslav, et al. “Hanani-Tutte for Radial Planarity.” <i>Journal of Graph Algorithms and Applications</i>, vol. 21, no. 1, Brown University, 2017, pp. 135–54, doi:<a href=\"https://doi.org/10.7155/jgaa.00408\">10.7155/jgaa.00408</a>.","short":"R. Fulek, M. Pelsmajer, M. Schaefer, Journal of Graph Algorithms and Applications 21 (2017) 135–154.","chicago":"Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity.” <i>Journal of Graph Algorithms and Applications</i>. Brown University, 2017. <a href=\"https://doi.org/10.7155/jgaa.00408\">https://doi.org/10.7155/jgaa.00408</a>.","apa":"Fulek, R., Pelsmajer, M., &#38; Schaefer, M. (2017). Hanani-Tutte for radial planarity. <i>Journal of Graph Algorithms and Applications</i>. Brown University. <a href=\"https://doi.org/10.7155/jgaa.00408\">https://doi.org/10.7155/jgaa.00408</a>","ieee":"R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,” <i>Journal of Graph Algorithms and Applications</i>, vol. 21, no. 1. Brown University, pp. 135–154, 2017.","ista":"Fulek R, Pelsmajer M, Schaefer M. 2017. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 21(1), 135–154."},"year":"2017","volume":21,"page":"135 - 154","file":[{"access_level":"open_access","file_size":573623,"date_updated":"2019-10-24T10:54:37Z","date_created":"2019-10-24T10:54:37Z","creator":"dernst","content_type":"application/pdf","file_name":"2017_JournalGraphAlgorithms_Fulek.pdf","success":1,"relation":"main_file","file_id":"6967"}],"publist_id":"6254","month":"01","has_accepted_license":"1","article_type":"original","ddc":["510"],"file_date_updated":"2019-10-24T10:54:37Z","publication_status":"published","date_created":"2018-12-11T11:50:13Z","status":"public","publication":"Journal of Graph Algorithms and Applications","related_material":{"record":[{"id":"1164","relation":"earlier_version","status":"public"},{"status":"public","relation":"earlier_version","id":"1595"}]},"oa_version":"Published Version","quality_controlled":"1"}