{"oa":1,"language":[{"iso":"eng"}],"publist_id":"6859","quality_controlled":"1","intvolume":"        24","file":[{"access_level":"open_access","relation":"main_file","file_name":"2017_ElectrCombi_Fulek.pdf","date_created":"2019-01-18T14:04:08Z","checksum":"ef320cff0f062051e858f929be6a3581","file_id":"5853","creator":"dernst","content_type":"application/pdf","date_updated":"2020-07-14T12:48:06Z","file_size":236944}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:48:06Z","day":"28","publication_status":"published","publication":"Electronic Journal of Combinatorics","date_published":"2017-07-28T00:00:00Z","project":[{"grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"_id":"795","volume":24,"author":[{"last_name":"Fulek","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav"},{"last_name":"Kynčl","full_name":"Kynčl, Jan","first_name":"Jan"},{"full_name":"Pálvölgyi, Dömötör","last_name":"Pálvölgyi","first_name":"Dömötör"}],"doi":"10.37236/6663","publication_identifier":{"issn":["10778926"]},"abstract":[{"text":"We introduce a common generalization of the strong Hanani–Tutte theorem and the weak Hanani–Tutte theorem: if a graph G has a drawing D in the plane where every pair of independent edges crosses an even number of times, then G has a planar drawing preserving the rotation of each vertex whose incident edges cross each other evenly in D. The theorem is implicit in the proof of the strong Hanani–Tutte theorem by Pelsmajer, Schaefer and Štefankovič. We give a new, somewhat simpler proof.","lang":"eng"}],"ddc":["000"],"year":"2017","issue":"3","publisher":"International Press","ec_funded":1,"status":"public","article_type":"original","department":[{"_id":"UlWa"}],"oa_version":"Published Version","type":"journal_article","citation":{"apa":"Fulek, R., Kynčl, J., &#38; Pálvölgyi, D. (2017). Unified Hanani Tutte theorem. <i>Electronic Journal of Combinatorics</i>. International Press. <a href=\"https://doi.org/10.37236/6663\">https://doi.org/10.37236/6663</a>","chicago":"Fulek, Radoslav, Jan Kynčl, and Dömötör Pálvölgyi. “Unified Hanani Tutte Theorem.” <i>Electronic Journal of Combinatorics</i>. International Press, 2017. <a href=\"https://doi.org/10.37236/6663\">https://doi.org/10.37236/6663</a>.","mla":"Fulek, Radoslav, et al. “Unified Hanani Tutte Theorem.” <i>Electronic Journal of Combinatorics</i>, vol. 24, no. 3, P3.18, International Press, 2017, doi:<a href=\"https://doi.org/10.37236/6663\">10.37236/6663</a>.","ista":"Fulek R, Kynčl J, Pálvölgyi D. 2017. Unified Hanani Tutte theorem. Electronic Journal of Combinatorics. 24(3), P3.18.","short":"R. Fulek, J. Kynčl, D. Pálvölgyi, Electronic Journal of Combinatorics 24 (2017).","ama":"Fulek R, Kynčl J, Pálvölgyi D. Unified Hanani Tutte theorem. <i>Electronic Journal of Combinatorics</i>. 2017;24(3). doi:<a href=\"https://doi.org/10.37236/6663\">10.37236/6663</a>","ieee":"R. Fulek, J. Kynčl, and D. Pálvölgyi, “Unified Hanani Tutte theorem,” <i>Electronic Journal of Combinatorics</i>, vol. 24, no. 3. International Press, 2017."},"date_created":"2018-12-11T11:48:32Z","has_accepted_license":"1","article_number":"P3.18","scopus_import":"1","article_processing_charge":"No","month":"07","date_updated":"2022-03-18T12:58:53Z","title":"Unified Hanani Tutte theorem"}