Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e., hierarchically clustered graphs that have the property that not only every cluster but also each complement of a cluster induces a connected subgraph. As a main result, we prove that a completely connected clustered graph is c-planar if and only if the underlying graph is planar. Further, we investigate the influence of the root of the inclusion tree to the choice of the outer face of the underlying graph and vice versa. © 2005 Elsevier B.V. All rights reserved.
Cornelsen, S., & Wagner, D. (2006). Completely connected clustered graphs. Journal of Discrete Algorithms, 4(2), 313–323. https://doi.org/10.1016/j.jda.2005.06.002