Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs

Abstract

We present a polynomial time algorithm for deciding clustered planarity of cycles and special eulerian graphs when the clusters are small (at most 3 vertices each).

Keywords

• Clustered
• Planarity
• Small
• Clusters
• Cycles
• Eulerian
• Graphs