36 CHAPTER 1. PLANARITY TESTING AND EMBEDDING
[CDPP05] P. F. Cortese, G. Di Battista, M. Patrignani, and M. P izz onia. Clustering
cycles into cycles of clusters. Journal of Graph Algorithms and Applica-
tions, Special Issue on the 2004 Symposium on Graph Drawing, GD ’04,
9(3):391–413, 2005.
[Che81] C. C. Chen . On a characterization of planar graphs. Bulletin of the
Australian Mathematical Society, 24:289–294, 1981.
[CMS08] M. Chimani, P. Mutzel, and J. M. Schmidt. Efficient extraction of mul-
tiple Kuratowski subdivisions. In Seok-Hee Hong, Takao Nishizeki, and
Wu Quan, editors, Graph Drawing (GD 2007), volume 4875 of LNCS,
pages 159–170. Springer, 2008.
[CNAO85] N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa. A linear algori th m for
embedding planar