Clustered planarity testing revisited
R. Fulek, J. Kynčl, I. Malinovič, D. Pálvölgyi, Electronic Journal of Combinatorics 22 (2015).
Download
Journal Article
| Published
| English
Scopus indexed
Author
Fulek, RadoslavIST Austria
;
Kynčl, Jan;
Malinovič, Igor;
Pálvölgyi, Dömötör

Department
Abstract
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 result to clustered graphs with two disjoint clusters, and show that a straightforward extension to flat clustered graphs with three or more disjoint clusters is not possible. For general clustered graphs we show a variant of the Hanani-Tutte theorem in the case when each cluster induces a connected subgraph. Di Battista and Frati proved that clustered planarity of embedded clustered graphs whose every face is incident to at most five vertices can be tested in polynomial time. We give a new and short proof of this result, using the matroid intersection algorithm.
Publishing Year
Date Published
2015-11-13
Journal Title
Electronic Journal of Combinatorics
Volume
22
Issue
4
Article Number
P4.24
IST-REx-ID
Cite this
Fulek R, Kynčl J, Malinovič I, Pálvölgyi D. Clustered planarity testing revisited. Electronic Journal of Combinatorics. 2015;22(4).
Fulek, R., Kynčl, J., Malinovič, I., & Pálvölgyi, D. (2015). Clustered planarity testing revisited. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics.
Fulek, Radoslav, Jan Kynčl, Igor Malinovič, and Dömötör Pálvölgyi. “Clustered Planarity Testing Revisited.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2015.
R. Fulek, J. Kynčl, I. Malinovič, and D. Pálvölgyi, “Clustered planarity testing revisited,” Electronic Journal of Combinatorics, vol. 22, no. 4. Electronic Journal of Combinatorics, 2015.
Fulek R, Kynčl J, Malinovič I, Pálvölgyi D. 2015. Clustered planarity testing revisited. Electronic Journal of Combinatorics. 22(4), P4.24.
Fulek, Radoslav, et al. “Clustered Planarity Testing Revisited.” Electronic Journal of Combinatorics, vol. 22, no. 4, P4.24, Electronic Journal of Combinatorics, 2015.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Main File(s)
File Name
IST-2016-714-v1+1_5002-15499-3-PB.pdf
443.65 KB
Access Level

Date Uploaded
2018-12-12
MD5 Checksum
40b5920b49ee736694f59f39588ee206