Clustered Planarity: Clusters with Few Outgoing Edges

Abstract

We present a linear algorithm for c-planarity testing of clustered graph in which every cluster has at most four outgoing edges.

Keywords

• Clustered
• Planarity
• Clusters
• Outgoing
• Edges