1. Damiand, G., Lienhardt, P.: Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing. A K Peters/CRC Press (2014)
2. Cori, R.: Un code pour les graphes planaires et ses applications. Ph.D. thesis, Université Paris 7 (1973)
3. Lecture Notes in Computer Science;G Damiand,2009
4. de la Higuera, C., Janodet, J.C., Samuel, E., Damiand, G., Solnon, C.: Polynomial algorithms for open plane graph and subgraph isomorphisms. Theor. Comput. Sci. 498, 76–99 (2013)
5. Dorn, F.: Planar subgraph isomorphism revisited. In: Proceedings of 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), vol. 5 of LIPIcs., Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 263–274(2010)