C-Planarity of Embedded Cyclic c-Graphs
We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows. Given a graph G with the vertex set partitioned into three parts embedded on a 2-sphere, our algorithm decides if we can augment G by adding edges without creating an edge-crossing so that in the resulting spherical graph the vertices of each part induce a connected sub-graph. We proceed by a reduction to the problem of testing the existence of a perfect matching in planar bipartite graphs. We formulate our result in a slightly more general setting of cyclic clustered graphs, i.e., the simple graph obtained by contracting each cluster, where we disregard loops and multi-edges, is a cycle.
I would like to thank Jan Kynčl and Dömötör Pálvölgyi for many comments and suggestions that helped to improve the presentation of the result.
- 2.Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Rutter, I., Beyond level planarity. arXiv preprint arXiv: 1510.08274 (2015)
- 5.Biedl, T.C.: Drawing planar partitions III: two constrained embedding problems. Rutcor Research Report 13-98 (1998)Google Scholar
- 14.Fulek, R.: Toward the Hanani-Tutte theorem for clustered graphs (2014). arXiv:1410.3022v2
- 19.Hong, S.-H., Nagamochi, H.: Simpler algorithms for testing two-page book embedding of partitioned graphs. Theor. Comput. Sci. (2016)Google Scholar