Completely connected clustered graphs

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.

[1]  Ulrik Brandes,et al.  Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles , 2003, Graph Drawing.

[2]  Michael Jünger,et al.  Advances in C-Planarity Testing of Clustered Graphs , 2002, Graph Drawing.

[3]  Ulrik Brandes,et al.  How to draw the minimum cuts of a planar graph , 2004, Comput. Geom..

[4]  Peter Eades,et al.  Drawing Clustered Graphs on an Orthogonal Grid , 1997, J. Graph Algorithms Appl..

[5]  Walter Didimo,et al.  Planarization of Clustered Graphs , 2001, Graph Drawing.

[6]  Marcus Raitner,et al.  HGV: A Library for Hierarchies, Graphs, and Views , 2002, GD.

[7]  Sue Whitesides,et al.  Proceedings of the 6th International Symposium on Graph Drawing , 1998 .

[8]  Mirka Miller,et al.  An Algorithm for Drawing Compound Graphs , 1999, GD.

[9]  Elias Dahlhaus,et al.  A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization , 1998, LATIN.

[10]  Robert F. Cohen,et al.  How to Draw a Planar Clustered Graph , 1995, COCOON.

[11]  Sabine Cornelsen.  Drawing Families of Cuts in a Graph , 2003 .

[12]  Dorothea Wagner,et al.  Completely Connected Clustered Graphs , 2003, WG.

[13]  Hiroshi Nagamochi,et al.  Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs , 1996, Algorithmica.

[14]  Robert F. Cohen,et al.  Planarity for Clustered Graphs , 1995, ESA.

[15]  Peter Eades,et al.  Multilevel Visualization of Clustered Graphs , 1996, GD.

[16]  Kozo Sugiyama,et al.  Visualization of structural information: automatic drawing of compound digraphs , 1991, IEEE Trans. Syst. Man Cybern..

[17]  J. Davenport.  Editor , 1960 .

[18]  Ulrik Brandes,et al.  How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract) , 2000, Graph Drawing.

[19]  Peter Eades,et al.  A Fully Animated Interactive System for Clustering and Navigating Huge Graphs , 1998, GD.

[20]  Xiaobo Wang,et al.  Generating Customized Layouts , 1995, Graph Drawing.

[21]  Xuemin Lin,et al.  Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs , 1996, Graph Drawing.