Clustered Planarity: Small Clusters in Eulerian Graphs

Abstract

We present several polynomial-time algorithms for c-planarity testing for clustered graphs with clusters of size at most three.

Keywords

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