How to Draw a Planar Clustered Graph
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
GD '95 Proceedings of the Symposium on Graph Drawing
A Fully Animated Interactive System for Clustering and Navigating Huge Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Planarization of Clustered Graphs
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
HGV: A Library for Hierarchies, Graphs, and Views
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Advances in C-Planarity Testing of Clustered Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Planarity for Clustered Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Multilevel Visualization of Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
How to draw the minimum cuts of a planar graph
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
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.