{"oa":1,"file":[{"file_id":"5853","checksum":"ef320cff0f062051e858f929be6a3581","content_type":"application/pdf","date_created":"2019-01-18T14:04:08Z","file_size":236944,"creator":"dernst","relation":"main_file","date_updated":"2020-07-14T12:48:06Z","access_level":"open_access","file_name":"2017_ElectrCombi_Fulek.pdf"}],"day":"28","author":[{"full_name":"Fulek, Radoslav","first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek","orcid":"0000-0001-8485-1774"},{"full_name":"Kynčl, Jan","first_name":"Jan","last_name":"Kynčl"},{"last_name":"Pálvölgyi","full_name":"Pálvölgyi, Dömötör","first_name":"Dömötör"}],"article_processing_charge":"No","doi":"10.37236/6663","_id":"795","file_date_updated":"2020-07-14T12:48:06Z","publist_id":"6859","type":"journal_article","department":[{"_id":"UlWa"}],"ddc":["000"],"status":"public","article_number":"P3.18","has_accepted_license":"1","project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"publication":"Electronic Journal of Combinatorics","scopus_import":"1","volume":24,"citation":{"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.","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.","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>","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>","short":"R. Fulek, J. Kynčl, D. Pálvölgyi, Electronic Journal of Combinatorics 24 (2017).","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>."},"date_published":"2017-07-28T00:00:00Z","language":[{"iso":"eng"}],"issue":"3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:48:32Z","publication_status":"published","publisher":"International Press","intvolume":"        24","title":"Unified Hanani Tutte theorem","quality_controlled":"1","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"}],"date_updated":"2022-03-18T12:58:53Z","ec_funded":1,"month":"07","article_type":"original","publication_identifier":{"issn":["10778926"]},"year":"2017","oa_version":"Published Version"}