{"place":"Cham","oa_version":"Preprint","volume":8871,"type":"conference","year":"2014","date_updated":"2023-02-23T10:08:04Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10793","status":"public","title":"Clustered planarity testing revisited","external_id":{"arxiv":["1305.4519"]},"citation":{"chicago":"Fulek, Radoslav, Jan Kynčl, Igor Malinović, and Dömötör Pálvölgyi. “Clustered Planarity Testing Revisited.” In <i>International Symposium on Graph Drawing</i>, 8871:428–36. Cham: Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-662-45803-7_36\">https://doi.org/10.1007/978-3-662-45803-7_36</a>.","ieee":"R. Fulek, J. Kynčl, I. Malinović, and D. Pálvölgyi, “Clustered planarity testing revisited,” in <i>International Symposium on Graph Drawing</i>, 2014, vol. 8871, pp. 428–436.","mla":"Fulek, Radoslav, et al. “Clustered Planarity Testing Revisited.” <i>International Symposium on Graph Drawing</i>, vol. 8871, Springer Nature, 2014, pp. 428–36, doi:<a href=\"https://doi.org/10.1007/978-3-662-45803-7_36\">10.1007/978-3-662-45803-7_36</a>.","apa":"Fulek, R., Kynčl, J., Malinović, I., &#38; Pálvölgyi, D. (2014). Clustered planarity testing revisited. In <i>International Symposium on Graph Drawing</i> (Vol. 8871, pp. 428–436). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-45803-7_36\">https://doi.org/10.1007/978-3-662-45803-7_36</a>","short":"R. Fulek, J. Kynčl, I. Malinović, D. Pálvölgyi, in:, International Symposium on Graph Drawing, Springer Nature, Cham, 2014, pp. 428–436.","ista":"Fulek R, Kynčl J, Malinović I, Pálvölgyi D. 2014. Clustered planarity testing revisited. International Symposium on Graph Drawing. , LNCS, vol. 8871, 428–436.","ama":"Fulek R, Kynčl J, Malinović I, Pálvölgyi D. Clustered planarity testing revisited. In: <i>International Symposium on Graph Drawing</i>. Vol 8871. Cham: Springer Nature; 2014:428-436. doi:<a href=\"https://doi.org/10.1007/978-3-662-45803-7_36\">10.1007/978-3-662-45803-7_36</a>"},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-45803-7_36","date_created":"2022-02-25T10:32:14Z","date_published":"2014-01-01T00:00:00Z","day":"01","publication_status":"published","page":"428-436","related_material":{"record":[{"relation":"later_version","id":"1642","status":"public"}]},"publisher":"Springer Nature","author":[{"id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","first_name":"Radoslav","last_name":"Fulek","full_name":"Fulek, Radoslav"},{"first_name":"Jan","last_name":"Kynčl","full_name":"Kynčl, Jan"},{"full_name":"Malinović, Igor","first_name":"Igor","last_name":"Malinović"},{"last_name":"Pálvölgyi","first_name":"Dömötör","full_name":"Pálvölgyi, Dömötör"}],"publication_identifier":{"issn":["0302-9743"]},"department":[{"_id":"UlWa"}],"month":"01","alternative_title":["LNCS"],"article_processing_charge":"No","publication":"International Symposium on Graph Drawing","intvolume":"      8871","scopus_import":"1","quality_controlled":"1","abstract":[{"lang":"eng","text":"The Hanani–Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generalize this classical result to clustered graphs with two disjoint clusters, and show that a straightforward extension of our result to flat clustered graphs with three or more disjoint clusters is not possible.\r\n\r\nWe also give a new and short proof for a related result by Di Battista and Frati based on the matroid intersection algorithm."}]}