We present several polynomial-time algorithms for c-planarity testing for clustered graphs with clusters of size at most three.
The most general result concerns a special class of Eulerian graphs, namely graphs obtained from a fixed-size 3-connected
graph by multiplying and then subdividing edges. We further give algorithms for 3-connected graphs, and for graphs with small
faces. The last result applies with no restrictions on the cluster size.